Catto - UCI chess engine
Author: Phu Minh Rating CEDR=2316
What do we currently have?
The engine
Negamax search algorithm with Alpha-Beta pruning.
Move ordering:
MVV-LVA heuristic.
Killer heuristic.
History heuristic.
Countermove heuristic.
Checkmate and stalemate detection.
Quiescence search.
Evalution:
PeSTO evaluation.
Pawn structure.
UCI.
The engine
Negamax search algorithm with Alpha-Beta pruning.
Move ordering:
MVV-LVA heuristic.
Killer heuristic.
History heuristic.
Countermove heuristic.
Checkmate and stalemate detection.
Quiescence search.
Evalution:
PeSTO evaluation.
Pawn structure.
UCI.
v.0.5.0:
Added check extensions, extend search depth by 1 when king is in check.
Added one reply extensions, extend search depth by 1 when only one move is possible (likely forced).
Comments
Post a Comment