25,161
edits
Changes
Bebe
,no edit summary
from the [[ACM 1980]] booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cdeeb The Eleventh ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1980_11th_ACM_NACCC/The_Eleventh_ACMs_North_American_Computer_Chess_Championship.1980.062303015.sm.pdf pdf] from [[The Computer History Museum]]</ref> :
Tony Scherzer, ''SYS-10, Inc.'', [https://en.wikipedia.org/wiki/Hoffman_Estates,_Illinois Hoffman Estates, Illinois], Bebe Chess Machine on site (32K bytes, 16 bits, 6,250,000 [https://en.wikipedia.org/wiki/Instructions_per_second inst/sec])
A relatively new program and machine, Bebe has recently acquired a provisional [https://en.wikipedia.org/wiki/US_Chess_Federation#Ratings UCSF rating] of 1810 based on play in one tournament. Bebe defeated an Expert in that tournament. Tony Scherzer's brainchild examines 10,000 [[Nodes per secondSecond|nodes/sec]] or about 2,000,000 in a three minute move. The program is small, requiring only 10k 16 bit words. The program has no book. It uses [[Iterative Deepening|iterative deepening]] and is written in [[Assembly|assembly language]].
==1981-1986==
