Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Computer chess
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Notable theorists == Well-known computer chess theorists include: * [[Georgy Adelson-Velsky]], a Soviet and Israeli mathematician and computer scientist * [[Hans Berliner]], American computer scientist and world correspondence chess champion, design supervisor of HiTech (1988) * [[Mikhail Botvinnik]], Soviet electrical engineer and world chess champion, wrote ''Pioneer'' * [[Alexander Brudno]], Russian computer scientist, first elaborated the alphabeta pruning algorithm * [[Feng-hsiung Hsu]], the lead developer of [[Deep Blue (chess computer)|Deep Blue]] (1986β97) * [[Robert Hyatt]] developed [[Cray Blitz]] and [[Crafty]]<ref>{{cite web|url=http://www.cis.uab.edu/info/faculty/hyatt/hyatt.html |title=Dr. Robert Hyatt's home page |publisher=Cis.uab.edu |date=2004-02-01 |access-date=2010-04-03}}</ref> * [[Danny Kopec]], American Professor or Computer Science and International Chess Master, developed Kopec-Bratko test * [[Alexander Kronrod]], Soviet computer scientist and mathematician * [[Monroe Newborn]], chairman of the computer chess committee for the Association for Computing Machinery * [[Claude E. Shannon]], American computer scientist and mathematician * [[Alan Turing]], English computer scientist and mathematician
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)