Single Comment

Computer resistant chess variants[Subject Thread] [Add Response]

Greg Strong wrote on Fri, Mar 11, 2016 05:10 AM UTC:

Regarding computer-resistant variants, Marseillais Chess is probably a good
candidate.  Since each player's move actually consists of two moves, the
branching factor is extremely high.  If a typical position has 30 possible
moves in Chess, then in Marseillais a player has about 900 options.  This
is much higher than in go so computers won't be able to see very deeply. 
Actually, it's somewhat less than 900 because some of them are effective
duplicates.  (a1-a2, b1-b2 is no different than b1-b2, a1-a2).  Also
evaluating a position is problematic because there are no quiet positions. 
The usual computer chess answer to this, quiescent search, is out the
window.  On the other hand, humans probably can't see very deeply in this
game either...

If that doesn't work, here's an alternative idea.  Computer-Resistant
Chess, copyright (c) 2016 by Greg Strong.  All the standard rules of Chess
apply, with the addition of the "Swizzelstick" rule: A player must make
each move with one hand, while touching the tip of his nose with the other,
and calling out "Swizzelstick!"  Any player who fails to do this
automatically forfeits.  Oh, and when you checkmate your opponent, it's not
official until you pee on his king.