Catto - UCI chess engine
Author: Phu Minh
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.1.1:
Add 3-fold repetition check.
Comments
Post a Comment