25,161
edits
Changes
Bebe
,no edit summary
'''Bebe''', (Be-Be)<br/>
a chess program running on a customized, special purpose [https://en.wikipedia.org/wiki/Bit_slicing bit slice] [[Hardware|hardware]] developed by [[Tony Scherzer|Tony]] and [[Linda Scherzer]] as [https://en.wikipedia.org/wiki/Testbed testbed] for their company's ''SYS-10, Inc.'' mini- and mainframe processors <ref>Linda Scherzer (1984): ''"We justify this as our research and development department. We try out the firmware in Bebe, then design it for commercial products".''</ref> . It was originally written on a [[Z80]] basis, as '''BB-1''' already standby at the [[ACM 1978]] <ref>Editor ('''1979'''). ''Scuffle in a Corner''. [[Personal Computing#3_8|Personal Computing, Vol. 3, No. 8]], pp. 76 » [[ACM 1978]], [[Bebe|BB-1]], [[Sargon]]</ref> <ref> [[Tony Scherzer]] ('''1979'''). ''Background on BB-1''. [[Personal Computing#3_11|Personal Computing, Vol. 3, No. 11]], pp. 80</ref>, and was ported to run on a ''SYS-10'' computer <ref>''SYS-10'', not to be confused with the decimal [http://members.iinet.net.au/~daveb/S10/Sys-10.html Singer System-10]</ref> , based on [https://en.wikipedia.org/wiki/AMD_Am2900 AMD 2900] bit slicers <ref>[http://www.linkedin.com/in/pwatt Peggy Watt] ('''1984'''). ''Mainframes checkmate Micros''. [https://en.wikipedia.org/wiki/InfoWorld InfoWorld], November 5, 1984, pp. 18, [httphttps://books.google.comde/books?id=oC4EAAAAMBAJ&pglpg=PA49&dq=InfoWorld,+November+5,+1984%2C%20November%205%2C%201984&client=firefox-a&cdhl=4de&pg=PA18#v=onepage&q=InfoWorld%2C,%20November%205%2C,%201984&f=false google books]</ref> .
While the hardware did no longer improve significantly since the mid 80s, the software and [[Opening Book|opening book]] did. Bebe approached [[Programming#Parallelism|parallelism]] in generating [[Attack and Defend Maps|attack and defend maps]], [[Move Generation|move generation]], [[Move Ordering|move ordering]], and [[Evaluation|evaluation]], but otherwise had a serial [[Search|search]]. Its implementation of [[Iterative Deepening|Iterative deepening]] was quite unique. To avoid the [[Odd-Even Effect|odd-even effect]], Bebe searched only odd [[Depth|depths]] with an increment of two [[Ply|plies]] at the [[Root|root]] <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/fb40c7c141dc062a Odd ply versus even ply searches] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 28, 1996</ref> . It further introduced a [[Learning|learning approach]] utilizing a [[Persistent Hash Table|persistent hash table]], explained in [[Bebe#Award|award winning]] paper <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]] </ref>.
