Template:Quote McCarthy on Alpha-Beta

From Chessprogramming wiki
Revision as of 15:40, 10 April 2018 by GerdIsenberg (talk | contribs) (Created page with "Quote by John McCarthy from ''Human-Level AI is harder than it seemed in 1955'': Chess programs catch some of...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955:

Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.