💡📝Hans Aberg wrote on Thu, Apr 24, 2008 08:13 PM UTC:
GMs only search 6-8 ply deep, looking through at most a few hundred searches per position. That is feasible for a brute force computer (with pruning and noting that position evaluation still is needed), give the rather low average number of moves per position in orthodox chess.
But suppose that the average number of moves per position is made a couple of times larger. If the game is still such that humans can play it strategically, then that might improve for humans in the competition with computers.