The depth limit is a way to tell the computer how many moves it should look ahead when it's playing chess. The computer looks that many steps into the future to decide what the best move is.
This chess algorithm employs the minimax algorithm with alpha-beta pruning to explore and evaluate the game tree, prioritizing moves that involve captures, checks, or promotions. It recursively searches for the best move at a given depth while pruning branches that don't improve the evaluation, ultimately selecting the optimal move for the current player.
This is a personal project with the goal of testing and developing different chess solving algorithms.
Check out my Sudoku Solver. See my other works at my website.