Chess Isn't Tough Enough: Better Games for Mind-Machine Competition

@misc{citeulike:2400610, abstract = {this paper), let's dive in and play an infinite game --- a game we call, in deference to some recent investigations carried out by Robert McNaughton, \"McNaught\" (McNaughton, 1993). McNaught isn't a game like chess, mind you: chess, as we've noted, is after all a finite game, one handled quite well by ordinary computation, as even Dreyfus must now admit. We're talking about an infinite game; here's how it works. You will need a place-marker (a dime will do nicely), and the graph shown in Figure...}, author = {Bringsjord, Selmer and Lally, Adam }, citeulike-article-id = {2400610}, keywords = {artificial-cognition, chess, turing-test}, posted-at = {2008-02-20 00:00:57}, priority = {0}, title = {Chess Isn't Tough Enough: Better Games for Mind-Machine Competition}, url = {http://citeseer.ist.psu.edu/121347.html} }

TY - GEN ID - citeulike:2400610 L3 - citeulike-article-id:2400610 TI - Chess Isn't Tough Enough: Better Games for Mind-Machine Competition N2 - this paper), let's dive in and play an infinite game --- a game we call, in deference to some recent investigations carried out by Robert McNaughton, "McNaught" (McNaughton, 1993). McNaught isn't a game like chess, mind you: chess, as we've noted, is after all a finite game, one handled quite well by ordinary computation, as even Dreyfus must now admit. We're talking about an infinite game; here's how it works. You will need a place-marker (a dime will do nicely), and the graph shown in Figure... KW - artificial-cognition KW - chess KW - turing-test AU - Bringsjord, Selmer AU - Lally, Adam UR - http://citeseer.ist.psu.edu/121347.html ER -