Author: Robert Hyatt
Date: 15:16:14 07/15/04
Go up one level in this thread
On July 15, 2004 at 16:03:04, Dann Corbit wrote: >On July 15, 2004 at 13:55:46, Robert Hyatt wrote: > >>On July 15, 2004 at 07:39:05, TEERAPONG TOVIRAT wrote: >> >>> >>>And.. Did he get any consolation prize? >>> >>>Thanks, >>>Teerapong >> >> >>Had to be Claude Shannon. He wrote _the_ paper on how to do a minimax search to >>play chess. Alpha-beta came later. > >This says Turning was before Shannon: >http://www.geocities.com/SiliconValley/Lab/7378/comphis.htm Turing wrote "something". But it wasn't a tree search program. It just produced a "plausibility score" that could be hand-computed for the famous games it played. No look-ahead of any kind. I suppose you could call that "chess programming". :) I was thinking about a "workable" chess algorithm, which Shannon actuall proposed in his paper. > >I seem to remember someone called 'Zeiss' (or something similar) who wrote a >computer chess program in 1947. But I might be misremembering.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.