Changes

Chess programs catch some of the human chess playing abilities but rely on the limited [[Branching Factor|effective branching]] of the chess move [[Search Tree|tree]]. The ideas that work for chess are inadequate for [[Go|go]]. [[Alpha-Beta|Alpha-beta pruning]] characterizes human play, but it wasn't noticed by [[:Category:Pioneer|early chess programmers]] - [[Alan Turing|Turing]], [[Claude Shannon|Shannon]], [[John Pasta|Pasta]] and [[Stanislaw Ulam|Ulam]], and [[Alex Bernstein|Bernstein]]. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by [[Arthur Samuel|Samuel]], [[Allen Newell|Newell]] and [[Herbert Simon|Simon]], McCarthy. Proved equivalent to [[Minimax|minimax]] by [[Timothy Hart|Hart]] and [[Michael Levin|Levin]], independently by [[Alexander Brudno|Brudno]]. [[Donald Knuth|Knuth]] gives details.