TalkChess.com

[Uri Blass]

perft(19) has at least 9 possible stalemates(both white and black has 3 options to change the order of moves at moves 1-3)

1.c4 2.h4 3.Qa4
1.h4 2.c4 3.Qa4
1.c4 2.Qa4 3.h4

1...h5 2...a5 3...Ra6
1...a5 2...h5 3...Ra6
1...a5 2...Ra6 3...h5



1.c4 h5 2.h4 a5 3.Qa4 Ra6 4.Qxa5 Rah6 5.Qxc7 f6 6.Qxd7+ Kf7 7.Qxb7 Qd3 8.Qxb8 Qh7 9.Qxc8 Kg6 10.Qe6 1/2-1/2

I wonder if people can calculate the number of stalemates in perft(19) and estimate this number for bigger n and the same for checkmates and I wonder if there is some n when the number of stalemates in perft(n) is bigger than the number of checkmates in perft(n).