Game Theory with Costly Computation [pdf]

5 years ago (cs.cornell.edu)

This pdf interested me as it touches on ideas about "best move" in chess. For sake of argument, accept that chess is drawn with not only perfect play, but also good enough play. The comparison of moves thus comes down to choosing lines which reduce your computational complexity for correct play while increasing your opponent's computational complexity for correct play. Better players can thus seek lines which increase computational complexity for both players to increase their odds of winning so long as they can continue to find correct moves

If anyone has more resources on these ideas, please share