Questions tagged [perft]

Perft, (performance test, move path enumeration) a debugging function to walk the move generation tree of strictly legal moves to count all the leaf nodes of a certain depth, which can be compared to predetermined values and used to isolate bugs.

Filter by
Sorted by
Tagged with
5
votes
1answer
344 views

There are three checks in this position?

I found this position in the Chess Programming Wiki. It's a perft calculation. In the depth 2 the results informs that there are 3 checks. But I just able to find 2 checks: Kf1 hxg2+ Kf1 Bxe2+ . [...
2
votes
0answers
115 views

Wrong perft result?

I'm writing a chess engine for fun. Currently I'm finishing writing the move generator. During the research I leaned about PERFT for debugging my software. Indeed, I found many bugs, some of them was "...
2
votes
2answers
460 views

Stockfish perft displays reversed game notation?

I'm debugging my engine using Stockfish, and I suddenly notice a massive difference between mine and Stockfish. Board and fen string +---+---+---+---+---+---+---+---+ | r | n | b | q | | k | | ...
3
votes
3answers
1k views

Validate Engine moves using Perft and divide

I'm developing a small Engine in Java, before trying something more elaborate in C/C++. Right now I'm running some perft tests (the 'perf_talkchess' file), but as expected it has some bugs. Consider ...
2
votes
1answer
442 views

Is there a chess engine with divide perft for captures only?

I'm programming a chess engine from scratch in C++, and I have it playing games on UCI against others already. I spent about four days trying to weed out bugs in my move generator, and finally did ...