3 ms·
I'm not a chess player but I'm pretty sure that's not how it works. 20 is only the depth of the search, the width is variable. Good players can prune the game
by nandemo 17y ago
I'm not a chess player but I'm pretty sure that's not how it works.
20 is only the depth of the search, the width is variable. Good players can prune the game tree aggressively -- i.e. they select only a few candidate moves at each step -- while still getting a good approximation of the best move.
- pk2200 17y agoYou're correct. The branching factor in a typical chess middlegame is 35-36, but top players usually only consider 1-3 moves per position. This is why the best humans were able to beat computers at chess for such a long time. (In the last 5-10 years the computers have pulled ahead, for good.)