Add perft section to readme #19
@@ -31,7 +31,7 @@ FEN is a single line string that describes a chess position. Format:
|
|||||||
|
|
||||||
# Perft Testing A Chess Engine
|
# Perft Testing A Chess Engine
|
||||||
|
|
||||||
**Perft** (“performance test”) walks the move tree *without move evaluation* and counts nodes at certain depths in the tree. It’s a standard way to verify an engine's **move generation + make/unmake (or make-on-copy)** are correct. The important to understand that the node counts have been generated and verified by the chess programming community, meaning that these counts are a reliable reference point for a chess engine to match against.
|
**Perft** (“performance test”) walks the move tree *without move evaluation* and counts nodes at certain depths in the tree. It’s a standard way to verify an engine's **move generation + make/unmake (or make-on-copy)** are correct. It's important to understand that the node counts have been generated and verified by the chess programming community, meaning that these counts are a reliable reference point for a chess engine to match against.
|
||||||
|
|
||||||
## What perft checks
|
## What perft checks
|
||||||
- **Legality filtering:** no moves that leave your own king in check.
|
- **Legality filtering:** no moves that leave your own king in check.
|
||||||
|
|||||||
Reference in New Issue
Block a user