Fruitless Recursion as a Strategy

Luring an opponent into fruitless recursion can be an effective strategy in other games, too. One of the most colorful, bizarre, and fascinating episodes in the history of man-vs.-machine chess came in a 2008 blitz showdown between American grandmaster Hikaru Nakamura and leading computer chess program Rybka. In a game where each side got just three minutes on the clock to play all of their moves or automatically lose, the advantage surely seemed to be on the side of the computer—capable of evaluating millions of positions every second, and of making its move without twitching a muscle. But Nakamura immediately gridlocked the board, and proceeded to make repetitive, meaningless moves as fast as he could click. Meanwhile, the computer wasted precious moments fruitlessly searching for winning variations that didn’t exist and doggedly trying to anticipate all the possible future moves by Nakamura, who himself was simply doing the chess equivalent of twiddling his thumbs. When the computer had nearly exhausted its time and began flailing so as not to lose by the clock, Nakamura finally opened the position and crashed through.

Notes:

Folksonomies: artificial intelligence game theory

Taxonomies:
/technology and computing/hardware/computer (0.915099)
/technology and computing/hardware/computer peripherals/computer monitors (0.864441)
/technology and computing/hardware/computer components (0.856137)

Concepts:
Chess (0.982976): dbpedia_resource
Computer chess (0.878246): dbpedia_resource
World Computer Chess Championship (0.839209): dbpedia_resource
Hikaru Nakamura (0.836288): dbpedia_resource
Chess engine (0.771484): dbpedia_resource
Swedish Chess Computer Association (0.677874): dbpedia_resource
Game (0.599333): dbpedia_resource
Chess Engines Grand Tournament (0.534792): dbpedia_resource

 Algorithms to Live By
Books, Brochures, and Chapters>Book:  Christian, Brian (April 19th 2016), Algorithms to Live By, Henry Holt and Co., Retrieved on 2021-09-27
Folksonomies: computer science algorithms optimization optimal living