Perft

[Joost Buijs]

If I understand correctly, all these results are without reusing intermediate results of transpositions? Would that be considered cheating for this exercise?

This is just to determine the correctness of the move-generator and to see how fast the move-gen/move-make logic is. In this case I think that Bert is using bulk-counting at the leaves, otherwise it would not be so fast.

Of course it is possible to make Perft() run faster by adding a hash-table and making it multi-threading, it wouldn't be cheating but this is not the aim here.

With a hash-table the speed (moves/sec.) will likely go down but the tree will get smaller and you will get the result faster.

[Tim Vermeulen]

Understandable! On chess forums I sometimes see people post perft results with and without caching, I guess it depends on what you want to measure exactly.