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.1:
Fixed LMR:
Fixed an error where rather than searching the first 4 moves of each depth at full depth, it will just search the first 4 moves it found at full depth.
Fixed an error where it might still perform LMR on moves that cause extensions.
Added hash move ordering.
Reduced search extensions limit due to it being too slow.
Comments
Post a Comment