Minimax chess engine
A depth-limited minimax search with alpha-beta pruning, written in Python with python-chess.
What it does
Given a position, the engine searches a fixed number of moves ahead and picks the move with the best guaranteed outcome.
How the search works
- Minimax: assume both sides play their best reply, and score each line from the engine’s point of view.
- Alpha-beta pruning: stop exploring a branch as soon as it can’t change the result.
- Depth limit: search a set number of plies, then score the position with a heuristic.
The evaluation heuristic
Describe what your heuristic rewards and why: material, piece activity, king safety, pawn structure.
What I’d try next
Move ordering, iterative deepening, a transposition table.