Difference between revisions of "Alex Bernstein"

From Chessprogramming wiki
Jump to: navigation, search
Line 8: Line 8:
 
=Quotes=
 
=Quotes=
 
{{Quote McCarthy on Alpha-Beta}}
 
{{Quote McCarthy on Alpha-Beta}}
 +
[[John McCarthy]] in ''The Dartmouth Workshop--as planned and as it happened'' <ref>[http://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html The Dartmouth Workshop--as planned and as it happened]</ref>
 +
Alex Bernstein of IBM presented his chess program under construction. My reaction was to invent and recommend to him alpha-beta pruning. He was unconvinced.
 +
 
=See also=  
 
=See also=  
 
* [[History|History of Computer Chess]]
 
* [[History|History of Computer Chess]]

Revision as of 11:37, 7 June 2019

Home * People * Alex Bernstein

Alex Bernstein [1]

Alex Bernstein,
an American mathematician, chess player and IBM employee. Along with his colleagues Michael de V. Roberts, Timothy Arbuckle and Martin Belsky, Alex Bernstein was primary author of the Bernstein Chess Program for the IBM 704.

Quotes

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

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.

John McCarthy in The Dartmouth Workshop--as planned and as it happened [2]

Alex Bernstein of IBM presented his chess program under construction. My reaction was to invent and recommend to him alpha-beta pruning. He was unconvinced.

See also

Publications

[3]

Forum Posts

External Links

References

Up one level