Author: guy haworth
Date: 11:48:13 10/02/01
Go up one level in this thread
I am assuming that you are asking how many legal positions are there - i.e. positions reachable from the original array. There is no really accurate answer as it is difficult to avoid the sntm-in-check feature in any simple counting process. It is however possible to avoid the sntm-in-'unblockable_check' using Eugene Nalimov's unblockable-check-avoiding index. I.J.Good ran a statistical test, placing pieces in random positions and seeing if the stm was in check. Seems as good as you can do. Again, more meaningful would be to count the number of non-equivalent positions, normalising on wtm and wK on e-h ... but allowing either side to move first. There was some count quoted in ICCA_J some years ago but it blew a factor of 4 by not making this assumption. G G
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.