Just for fun, I run Perft(10) of the position posted some days ago:
[d]
Code: Select all
JetChess 1.0.0.0 (hash = 1024 MB).
Perft(10):
1 c4*d3e 2252209105011
2 ke5-d5 2629527467305
3 ke5*d4 2486035610243
4 ke5-d6 2936067586692
5 ke5-e6 2862406173676
Total: 13166245942927
13,166,245,942,927 (move pathes after 10 half moves).
Time: 9069.629 s.

If there is no problem obtaining correct Perft(8), Perft(9) and Perft(10) values of this position, I think (bear in mind that I do not know about programming) that the code is successfully debugged (especially en passant captures issue). Good luck with your perft counters!
Regards from Spain.
Ajedrecista.