The move that results in the most complicated board position, thereby requiring the most amount of time to process accurately.
The ideal chess player will find a winning move - if there is one. But can "the best drawing/losing move" ("best trap") be usefully defined?
-
-
-
Well, yeah, but is there a clean if useless mathematical definition of "position complexity" as there is of a winning move? I don't know one
- 1 more reply
New conversation -
-
-
For tic-tac-toe I defined it as best expectation value against a drunk opponent. Not sure if expectimax is practical for chess, though.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.