Hello Luis:
Luis Babboni wrote:SOLVED!
Here is the correct definition of Perft:
Aleks Peshkov wrote:Perft is recursive number of legal moves.
Perft for depth 1 is number of legal moves from the given position.
Perft for depth N is sum of legal moves for all positions of Perft N-1.
Here is, in fact, how JetChess perft counter reports perft(2) of that position:
Code: Select all
1 Re7-e8 0
2 Re7-f7 5
3 Re7*g7 3
4 Re7-d7 5
5 Re7-c7 5
6 Re7-b7 5
7 Re7-a7 5
8 Re7-e6 5
9 Re7-e5 5
10 Re7-e4 5
11 Re7-e3 5
12 Re7-e2 5
13 Re7-e1 5
14 Kh1-g1 5
15 Kh1-g2 5
16 Kh1-h2 5
Total: 73
Just to complete my post:
Code: Select all
perft(1) = 16
perft(2) = 73
perft(3) = 1,241
perft(4) = 5,861
perft(5) = 101,487
perft(6) = 539,658
perft(7) = 9,389,471
perft(8) = 55,628,133
perft(9) = 970,934,310
perft(10) = 6,203,290,408
perft(11) = 108,581,645,499
perft(12) = 731,006,640,533
perft(13) = 12,821,244,003,733
perft(14) = 89,335,944,621,556
perft(15) = 1,568,592,660,477,175
perft(16) = 11,198,005,325,037,030
perft(17) = 196,680,381,198,782,558
perft(18) = 1,431,536,409,060,656,547
I hope no typos.
Regards from Spain.
Ajedrecista.