25,161
edits
Changes
Bebe
,Created page with "'''Home * Engines * Bebe''' border|right|thumb|266px|link=Linda Scherzer| [[Linda Scherzer and Bebe <ref>Cartoons|Cartoo..."
'''[[Main Page|Home]] * [[Engines]] * Bebe'''
[[FILE:LindaScherzerCartoon.JPG|border|right|thumb|266px|link=Linda Scherzer| [[Linda Scherzer]] and Bebe <ref>[[Cartoons|Cartoon]] by Jeff Ragsdale from the [[ICGA Journal|ICCA Journal]] 1987, 1988 and 1989, reprinted in [http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> ]]
'''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, [http://books.google.com/books?id=oC4EAAAAMBAJ&pg=PA49&dq=InfoWorld,+November+5,+1984&client=firefox-a&cd=4#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>.
After Tony Scherzer's early death in January 1995 <ref>[http://www.familysearch.org/Eng/Search/IGI/individual_record.asp?recid=100000058897&lds=1®ion=11®ionfriendly=North+America&frompage=99 IGI Individual Record - Anthony Scherzer]</ref> , the work on Bebe discontinued, while ''SYS-10, Inc.'' continued, and is now a company providing custom software applications located in [https://en.wikipedia.org/wiki/South_Elgin,_Illinois South Elgin, Illinois] <ref>[http://www.sys-10.com/ Welcome to SYS-10, Inc.]</ref> , owned by Linda Scherzer since 1978 <ref>[http://www.linkedin.com/in/lindascherzer Linda Scherzer (Shinouskis) - LinkedIn]</ref> .
=Photos & Games=
[[FILE:ACM1984BebeNovag.JPG|none|border|text-bottom|640px]]
[[Linda Scherzer|Linda]] and [[Tony Scherzer]], Bob Henry and [[David Kittinger]] at [[ACM 1984]], Bebe vs. [[Novag]] <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, [http://books.google.com/books?id=oC4EAAAAMBAJ&pg=PA49&dq=InfoWorld,+November+5,+1984&client=firefox-a&cd=4#v=onepage&q=InfoWorld%2C%20November%205%2C%201984&f=false google books]</ref>
<pre>
[Event "ACM 1984"]
[Site "San Francisco USA"]
[Date "1984.10.09"]
[Round "4"]
[White "Bebe"]
[Black "Novag"]
[Result "1-0"]
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.O-O b5 6.Bb3 d6 7.Ng5 d5 8.exd5 Nd4
9.d6 Nxb3 10.dxc7 Qxc7 11.axb3 h6 12.Nf3 e4 13.Re1 Be7 14.Nc3 exf3 15.Nxb5 Qc5
16.Qxf3 Qxb5 17.Qxa8 Qb7 18.Qxb7 Bxb7 19.d4 Kd7 20.c4 Bb4 21.Re2 Rd8 22.d5 Nxd5
23.cxd5 Bxd5 24.Rxa6 Bxb3 25.Re4 Bc5 26.Be3 Kc7 27.Ra1 Bd5 28.Bf4+ Kc6 29.Rea4
Be6 30.Be5 Rd2 31.Bxg7 Bxf2+ 32.Kh1 Bd5 33.Bc3 Rc2 34.Ra6+ Kc7 35.R6a5 Kc6
36.Ra6+ Kc7 37.R6a5 Kc6 38.Ra8 Bb6 39.Rg8 f5 40.Rg6+ Kb5 41.Rd1 Be4 42.Bd2 Rxb2
43.Bxh6 f4 44.Rg5+ Kc6 45.Rc1+ Kd6 46.Bg7 Rf2 47.Rd1+ Kc6 48.Be5 Be3 49.Rg4 Bc2
50.Ra1 Kd5 51.Bb8 f3 52.gxf3 Rxf3 53.Ra5+ Ke6 54.h4 Bf5 55.Rga4 Kf7 56.Kg2 Rf2+
57.Kg3 Rf1 58.Bf4 Bf2+ 59.Kg2 Bd3 60.Rd5 Be2 61.Rd7+ Kg6 62.h5+ Kxh5 63.Rd2 Bb6
64.Rxe2 Rg1+ 65.Kh2 Rb1 66.Rg2 Rb5 67.Ra6 Rf5 68.Kg3 Rf6 1-0
</pre>
=Achievements=
Bebe was one of the strongest chess entities in the 80s. At its first appearance, the [[WCCC 1980]] in [https://en.wikipedia.org/wiki/Linz Linz], it finished best placed "Micro" <ref>[http://www.computerwoche.de/heftarchiv/1980/48/1191318/ Mikros noch ohne Großmeister-Format] November 28, 1980, [[Computerworld#Woche|Computerwoche]] 48/1980 (German)</ref> . Four draws in four rounds, playing programs like [[Chess (Program)|Chess 4.9]] and [[Nuchess]]. The following three [[World Computer Chess Championship|World Computer Chess Championships]] were even more successful. Bebe was first runner up at the [[WCCC 1983]] in [https://en.wikipedia.org/wiki/New_York_City New York], tied for first place at the [[WCCC 1986]] in [https://en.wikipedia.org/wiki/Cologne Cologne], and finally was runner up again in [https://en.wikipedia.org/wiki/Edmonton Edmonton] at the [[WCCC 1989]]. As mentioned by [[Robert Hyatt]], Bebe "helped" [[Cray Blitz]] to win both the [[WCCC 1983]] and the [[WCCC 1986]] <ref>[https://www.stmintz.com/ccc/index.php?id=201764 Re: Who is the better chess program author? (more)] by [[Robert Hyatt]], [[CCC]], December 13, 2001</ref> .
Bebe further played 13 consecutive [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], including the already mentioned WCCC in New York, from [[ACM 1980|1980]] until [[ACM 1993|1993]], again runner up in [[ACM 1981|1981]] (tied), [[ACM 1984|1984]] and [[ACM 1985|1985]].
<span id="Singular"></span>
=Selective Deepening=
At [[ACM 1986]], after winning [[ChipTest]], [[Merlin]] and [[Rebel|Recom]], Bebe lost to [[Belle]], the eventual winner. In the battle for the second place, Bebe was defeated by [[Lachex]]. Both programs went in a sequence of forced moves where both sides had only one single good choice along the way. Neither program had any idea about who would come up ahead in the end, until suddenly after playing along the forced line, both programs realized that Bebe was lost. In a discussion with [[Feng-hsiung Hsu]] and others, Tony Scherzer made the statement that the old idea of selective [[Pruning|pruning]] was dead, replaced by the new idea of selective [[Extensions|extensions]] . According to Hsu, that was how the idea of [[Singular Extensions]] began <ref>[[Feng-hsiung Hsu]] ('''2002'''). ''[http://press.princeton.edu/titles/7342.html Behind Deep Blue]: Building the Computer that Defeated the World Chess Champion'', Princeton University Press, ISBN 0-691-09065-3, pp. 54-55</ref> .
<pre>
[Event "ACM 1986"]
[Site "Dallas USA"]
[Date "1986.11.05"]
[Round "5"]
[White "Lachex"]
[Black "Bebe"]
[Result "1-0"]
1.e4 c5 2.c3 d5 3.exd5 Qxd5 4.d4 e6 5.Nf3 Nc6 6.Na3 Bd7 7.Bc4 Qe4+ 8.Qe2 Qxe2+
9.Bxe2 cxd4 10.Nb5 O-O-O 11.cxd4 Bb4+ 12.Nc3 Be8 13.Be3 Nge7 14.O-O Ng6
15.Rad1 Kb8 16.a3 Bd6 17.d5 exd5 18.Rxd5 Nf4 19.Rxd6 Nxe2+ 20.Nxe2 Rxd6
21.Bf4 Kc8 22.Bxd6 Bd7 23.Rc1 Bg4 24.Ned4 Bxf3 25.gxf3 Kd7 26.Nxc6 bxc6
27.Rd1 Kc8 28.Bf4 Rd8 29.Rxd8+ Kxd8 30.b4 a6 31.Kf1 Ke7 32.Ke2 Ke6 33.Kd3 Kd5
34.Be3 g6 35.a4 h5 36.h4 f6 37.f4 f5 38.Bb6 Ke6 39.Kc4 Kd6 40.f3 1-0
</pre>
=Descriptions=
==1980==
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 second|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==
* [[ACM 1981]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ce737 The Twelfth ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1981_ACM_NACCC/1981_ACM_NACCC.sm.062303017.pdf pdf] from [[The Computer History Museum]]</ref> : Tony Scherzer, Hoffman Estates, Illinois, Bebe 25.000 Nodes/Sec
* [[WCCC 1983]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6c8af8 The Fourth World Computer Chess Championship] (labeled 22nd ACM), [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1983_WCCC/1983-%20WCCC.062303061.sm.pdf pdf] from [[The Computer History Museum]], [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_36_C.pdf pdf] by [[Danny Kopec]]</ref> : Tony Scherzer, ''SYS-10 Inc.'', Hoffman Estates, Illinois, Bebe Chess Engine, 7 [https://en.wikipedia.org/wiki/Million_instructions_per_second#Million_instructions_per_second mips], 20K Nodes/Sec
* [[ACM 1984]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6c9575 The Fifteenth ACM Computer Chess Championship, San Francisco California, October 7-9, 1984], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1984_15th_NACCC/1984%20NACCC.062303012.sm.pdf pdf] from [[The Computer History Museum]]</ref> : Tony Scherzer, ''SYS-20 Inc.'', Hoffman Estates, Illinois, Bebe Chess Engine 20K Nodes/Sec
* [[ACM 1986]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ca4a7 The ACM's Seventeenth North American Computer Chess Championship and The Sixth World Microcomputer Chess Championship] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1986_17th_NACCC/1986%20NACCC.062303062.sm.pdf pdf]</ref> : Tony Scherzer and Linda Scherzer, SYS-10 Inc., Hoffman Estates, Illinois, Bebe Chess Engine 40K Nodes/Sec
==1989==
from the [[WCCC 1989]] booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> :
Tony Scherzer and Linda Scherzer, SYS-10 Inc., Hoffman Estates, Illinois, Bebe Chess Engine, 40K Nodes/Sec
In early 1980 SYS-10 tried new hardware techniques needed for their mini/mainframe processor in co-processors for BeBe's CPU. Each co-processor takes over a specific function from the main CPU.
The first co-processor does the complete task of [[Move Generation|move list generation]]. The actual unit is divided into two processors which function in parallel: one that finds pieces and one that calculate and stores moves. This parallelism provides results more than 25 times faster than software.
A second co-processor performs the [[Evaluation|position scoring]] function. The scorer "looks at" the output of the move generator and uses the moves to calculate values for piece position [[Mobility|mobility]] and co-operation. The scorer functions in parallel with the move generator.
BeBe operates at four distinct levels:
* <code>Software does I/O, [[Time Management|timekeeping]], [[Opening Book|book lookup]], [[Depth|search depth]] control, and overall system control.</code>
* <code>Special CPU instructions do [[Move Ordering|move list sorting]], [[Board Representation|internal board]] [[Incremental Updates|update]] for [[Make Move|making]] and [[Unmake Move|unmaking moves]], the [[Alpha-Beta|alpha-beta]] minimax control, keeping track of [[Killer Move|killer moves]], building [[Bitboards|bit maps]] of piece locations, and some board scoring functions.</code>
* <code>The co-processors perform move list generation, and some of the board scoring functions.</code>
* <code>The self-activated parallel processor determines of either [[Check|king is in check]] and determines the [[Attack and Defend Maps|attack-defender count]] for any [[Squares|square]]. Because it self starts, the answers for both kings are ready before the software can ask the question. </code>
<span id="Award"></span>
=Mephisto Best-Publication Award=
The fourth [[Hegener & Glaser#MephistoAward|Mephisto Best-Publication Award]] for publications between April 01, 1990 and March 31, 1991 is awarded to [[Tony Scherzer|Tony]] and [[Linda Scherzer]] and [[Dean Tjaden]] for their article ''Learning in Bebe'' published in [[Computers, Chess, and Cognition]] <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]]</ref>, explaining the implementation of a [[Persistent Hash Table#LearninginBebe|persistent hash table]] inside BeBe. The jury consisted of [[Jaap van den Herik]], [[David Levy]], [[Tony Marsland]], [[Jonathan Schaeffer]] and [[Ken Thompson]]. The image by Jaap van den Herik from the Award giving ceremony during [[ACM 1991]], November 20, 1991, [https://en.wikipedia.org/wiki/Albuquerque%2C_New_Mexico Albuquerque], [https://en.wikipedia.org/wiki/New_Mexico New Mexico], published in [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]] <ref>The Board of ICCA ('''1991'''). ''The Mephisto Best-Publication Award''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]], pp. 211</ref>, the same issue also containes a condensed version of the paper <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1991'''). ''Learning in Bebe.'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
[[FILE:LearningInBeBe.jpg|none|border|text-bottom|560px]]
[[Linda Scherzer]] with the Award <ref>[[Linda Scherzer]] with the Award (a [[Mephisto Vancouver]] ?)</ref>, [[ICCA]] representant [[Tony Marsland]], and [[Tony Scherzer]] .
=See also=
* [[Various Classifications#GivenName|Given Name]]
* [[Odd-Even Effect]]
* [[Persistent Hash Table]]
=Publications=
* Editor ('''1979'''). ''Scuffle in a Corner''. [[Personal Computing#3_8|Personal Computing, Vol. 3, No. 8]], pp. 76 » [[ACM 1978]], [[Sargon]]
* [[Tony Scherzer]] ('''1979'''). ''Background on BB-1''. [[Personal Computing#3_11|Personal Computing, Vol. 3, No. 11]], pp. 80
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]] » [[BeBe#Award|Mephisto Best-Publication Award]]
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1991'''). ''Learning in Bebe.'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess/wkTUUFfEvIE/RyFnJTjyQq4J Machine Learning Experience] by [[Michael Valvo|Mike Valvo]], [[Computer Chess Forums|rgc]], January 22, 1990
* [https://www.stmintz.com/ccc/index.php?id=71765 Bebe and Belle] by Joshua Lee, [[CCC]], October 04, 1999 » [[Belle]]
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=350 Bebe's ICGA Tournaments]
==Misc==
* [http://en.wiktionary.org/wiki/bebe bebe - Wiktionary]
* [http://en.wiktionary.org/wiki/beb%C3%A9 bebé - Wiktionary]
* [https://en.wikipedia.org/wiki/Bebe Bebe from Wikipedia] (Disambiguation page)
=References=
<references />
'''[[Engines|Up one level]]'''
[[FILE:LindaScherzerCartoon.JPG|border|right|thumb|266px|link=Linda Scherzer| [[Linda Scherzer]] and Bebe <ref>[[Cartoons|Cartoon]] by Jeff Ragsdale from the [[ICGA Journal|ICCA Journal]] 1987, 1988 and 1989, reprinted in [http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> ]]
'''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, [http://books.google.com/books?id=oC4EAAAAMBAJ&pg=PA49&dq=InfoWorld,+November+5,+1984&client=firefox-a&cd=4#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>.
After Tony Scherzer's early death in January 1995 <ref>[http://www.familysearch.org/Eng/Search/IGI/individual_record.asp?recid=100000058897&lds=1®ion=11®ionfriendly=North+America&frompage=99 IGI Individual Record - Anthony Scherzer]</ref> , the work on Bebe discontinued, while ''SYS-10, Inc.'' continued, and is now a company providing custom software applications located in [https://en.wikipedia.org/wiki/South_Elgin,_Illinois South Elgin, Illinois] <ref>[http://www.sys-10.com/ Welcome to SYS-10, Inc.]</ref> , owned by Linda Scherzer since 1978 <ref>[http://www.linkedin.com/in/lindascherzer Linda Scherzer (Shinouskis) - LinkedIn]</ref> .
=Photos & Games=
[[FILE:ACM1984BebeNovag.JPG|none|border|text-bottom|640px]]
[[Linda Scherzer|Linda]] and [[Tony Scherzer]], Bob Henry and [[David Kittinger]] at [[ACM 1984]], Bebe vs. [[Novag]] <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, [http://books.google.com/books?id=oC4EAAAAMBAJ&pg=PA49&dq=InfoWorld,+November+5,+1984&client=firefox-a&cd=4#v=onepage&q=InfoWorld%2C%20November%205%2C%201984&f=false google books]</ref>
<pre>
[Event "ACM 1984"]
[Site "San Francisco USA"]
[Date "1984.10.09"]
[Round "4"]
[White "Bebe"]
[Black "Novag"]
[Result "1-0"]
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.O-O b5 6.Bb3 d6 7.Ng5 d5 8.exd5 Nd4
9.d6 Nxb3 10.dxc7 Qxc7 11.axb3 h6 12.Nf3 e4 13.Re1 Be7 14.Nc3 exf3 15.Nxb5 Qc5
16.Qxf3 Qxb5 17.Qxa8 Qb7 18.Qxb7 Bxb7 19.d4 Kd7 20.c4 Bb4 21.Re2 Rd8 22.d5 Nxd5
23.cxd5 Bxd5 24.Rxa6 Bxb3 25.Re4 Bc5 26.Be3 Kc7 27.Ra1 Bd5 28.Bf4+ Kc6 29.Rea4
Be6 30.Be5 Rd2 31.Bxg7 Bxf2+ 32.Kh1 Bd5 33.Bc3 Rc2 34.Ra6+ Kc7 35.R6a5 Kc6
36.Ra6+ Kc7 37.R6a5 Kc6 38.Ra8 Bb6 39.Rg8 f5 40.Rg6+ Kb5 41.Rd1 Be4 42.Bd2 Rxb2
43.Bxh6 f4 44.Rg5+ Kc6 45.Rc1+ Kd6 46.Bg7 Rf2 47.Rd1+ Kc6 48.Be5 Be3 49.Rg4 Bc2
50.Ra1 Kd5 51.Bb8 f3 52.gxf3 Rxf3 53.Ra5+ Ke6 54.h4 Bf5 55.Rga4 Kf7 56.Kg2 Rf2+
57.Kg3 Rf1 58.Bf4 Bf2+ 59.Kg2 Bd3 60.Rd5 Be2 61.Rd7+ Kg6 62.h5+ Kxh5 63.Rd2 Bb6
64.Rxe2 Rg1+ 65.Kh2 Rb1 66.Rg2 Rb5 67.Ra6 Rf5 68.Kg3 Rf6 1-0
</pre>
=Achievements=
Bebe was one of the strongest chess entities in the 80s. At its first appearance, the [[WCCC 1980]] in [https://en.wikipedia.org/wiki/Linz Linz], it finished best placed "Micro" <ref>[http://www.computerwoche.de/heftarchiv/1980/48/1191318/ Mikros noch ohne Großmeister-Format] November 28, 1980, [[Computerworld#Woche|Computerwoche]] 48/1980 (German)</ref> . Four draws in four rounds, playing programs like [[Chess (Program)|Chess 4.9]] and [[Nuchess]]. The following three [[World Computer Chess Championship|World Computer Chess Championships]] were even more successful. Bebe was first runner up at the [[WCCC 1983]] in [https://en.wikipedia.org/wiki/New_York_City New York], tied for first place at the [[WCCC 1986]] in [https://en.wikipedia.org/wiki/Cologne Cologne], and finally was runner up again in [https://en.wikipedia.org/wiki/Edmonton Edmonton] at the [[WCCC 1989]]. As mentioned by [[Robert Hyatt]], Bebe "helped" [[Cray Blitz]] to win both the [[WCCC 1983]] and the [[WCCC 1986]] <ref>[https://www.stmintz.com/ccc/index.php?id=201764 Re: Who is the better chess program author? (more)] by [[Robert Hyatt]], [[CCC]], December 13, 2001</ref> .
Bebe further played 13 consecutive [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], including the already mentioned WCCC in New York, from [[ACM 1980|1980]] until [[ACM 1993|1993]], again runner up in [[ACM 1981|1981]] (tied), [[ACM 1984|1984]] and [[ACM 1985|1985]].
<span id="Singular"></span>
=Selective Deepening=
At [[ACM 1986]], after winning [[ChipTest]], [[Merlin]] and [[Rebel|Recom]], Bebe lost to [[Belle]], the eventual winner. In the battle for the second place, Bebe was defeated by [[Lachex]]. Both programs went in a sequence of forced moves where both sides had only one single good choice along the way. Neither program had any idea about who would come up ahead in the end, until suddenly after playing along the forced line, both programs realized that Bebe was lost. In a discussion with [[Feng-hsiung Hsu]] and others, Tony Scherzer made the statement that the old idea of selective [[Pruning|pruning]] was dead, replaced by the new idea of selective [[Extensions|extensions]] . According to Hsu, that was how the idea of [[Singular Extensions]] began <ref>[[Feng-hsiung Hsu]] ('''2002'''). ''[http://press.princeton.edu/titles/7342.html Behind Deep Blue]: Building the Computer that Defeated the World Chess Champion'', Princeton University Press, ISBN 0-691-09065-3, pp. 54-55</ref> .
<pre>
[Event "ACM 1986"]
[Site "Dallas USA"]
[Date "1986.11.05"]
[Round "5"]
[White "Lachex"]
[Black "Bebe"]
[Result "1-0"]
1.e4 c5 2.c3 d5 3.exd5 Qxd5 4.d4 e6 5.Nf3 Nc6 6.Na3 Bd7 7.Bc4 Qe4+ 8.Qe2 Qxe2+
9.Bxe2 cxd4 10.Nb5 O-O-O 11.cxd4 Bb4+ 12.Nc3 Be8 13.Be3 Nge7 14.O-O Ng6
15.Rad1 Kb8 16.a3 Bd6 17.d5 exd5 18.Rxd5 Nf4 19.Rxd6 Nxe2+ 20.Nxe2 Rxd6
21.Bf4 Kc8 22.Bxd6 Bd7 23.Rc1 Bg4 24.Ned4 Bxf3 25.gxf3 Kd7 26.Nxc6 bxc6
27.Rd1 Kc8 28.Bf4 Rd8 29.Rxd8+ Kxd8 30.b4 a6 31.Kf1 Ke7 32.Ke2 Ke6 33.Kd3 Kd5
34.Be3 g6 35.a4 h5 36.h4 f6 37.f4 f5 38.Bb6 Ke6 39.Kc4 Kd6 40.f3 1-0
</pre>
=Descriptions=
==1980==
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 second|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==
* [[ACM 1981]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ce737 The Twelfth ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1981_ACM_NACCC/1981_ACM_NACCC.sm.062303017.pdf pdf] from [[The Computer History Museum]]</ref> : Tony Scherzer, Hoffman Estates, Illinois, Bebe 25.000 Nodes/Sec
* [[WCCC 1983]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6c8af8 The Fourth World Computer Chess Championship] (labeled 22nd ACM), [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1983_WCCC/1983-%20WCCC.062303061.sm.pdf pdf] from [[The Computer History Museum]], [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_36_C.pdf pdf] by [[Danny Kopec]]</ref> : Tony Scherzer, ''SYS-10 Inc.'', Hoffman Estates, Illinois, Bebe Chess Engine, 7 [https://en.wikipedia.org/wiki/Million_instructions_per_second#Million_instructions_per_second mips], 20K Nodes/Sec
* [[ACM 1984]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6c9575 The Fifteenth ACM Computer Chess Championship, San Francisco California, October 7-9, 1984], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1984_15th_NACCC/1984%20NACCC.062303012.sm.pdf pdf] from [[The Computer History Museum]]</ref> : Tony Scherzer, ''SYS-20 Inc.'', Hoffman Estates, Illinois, Bebe Chess Engine 20K Nodes/Sec
* [[ACM 1986]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ca4a7 The ACM's Seventeenth North American Computer Chess Championship and The Sixth World Microcomputer Chess Championship] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1986_17th_NACCC/1986%20NACCC.062303062.sm.pdf pdf]</ref> : Tony Scherzer and Linda Scherzer, SYS-10 Inc., Hoffman Estates, Illinois, Bebe Chess Engine 40K Nodes/Sec
==1989==
from the [[WCCC 1989]] booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> :
Tony Scherzer and Linda Scherzer, SYS-10 Inc., Hoffman Estates, Illinois, Bebe Chess Engine, 40K Nodes/Sec
In early 1980 SYS-10 tried new hardware techniques needed for their mini/mainframe processor in co-processors for BeBe's CPU. Each co-processor takes over a specific function from the main CPU.
The first co-processor does the complete task of [[Move Generation|move list generation]]. The actual unit is divided into two processors which function in parallel: one that finds pieces and one that calculate and stores moves. This parallelism provides results more than 25 times faster than software.
A second co-processor performs the [[Evaluation|position scoring]] function. The scorer "looks at" the output of the move generator and uses the moves to calculate values for piece position [[Mobility|mobility]] and co-operation. The scorer functions in parallel with the move generator.
BeBe operates at four distinct levels:
* <code>Software does I/O, [[Time Management|timekeeping]], [[Opening Book|book lookup]], [[Depth|search depth]] control, and overall system control.</code>
* <code>Special CPU instructions do [[Move Ordering|move list sorting]], [[Board Representation|internal board]] [[Incremental Updates|update]] for [[Make Move|making]] and [[Unmake Move|unmaking moves]], the [[Alpha-Beta|alpha-beta]] minimax control, keeping track of [[Killer Move|killer moves]], building [[Bitboards|bit maps]] of piece locations, and some board scoring functions.</code>
* <code>The co-processors perform move list generation, and some of the board scoring functions.</code>
* <code>The self-activated parallel processor determines of either [[Check|king is in check]] and determines the [[Attack and Defend Maps|attack-defender count]] for any [[Squares|square]]. Because it self starts, the answers for both kings are ready before the software can ask the question. </code>
<span id="Award"></span>
=Mephisto Best-Publication Award=
The fourth [[Hegener & Glaser#MephistoAward|Mephisto Best-Publication Award]] for publications between April 01, 1990 and March 31, 1991 is awarded to [[Tony Scherzer|Tony]] and [[Linda Scherzer]] and [[Dean Tjaden]] for their article ''Learning in Bebe'' published in [[Computers, Chess, and Cognition]] <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]]</ref>, explaining the implementation of a [[Persistent Hash Table#LearninginBebe|persistent hash table]] inside BeBe. The jury consisted of [[Jaap van den Herik]], [[David Levy]], [[Tony Marsland]], [[Jonathan Schaeffer]] and [[Ken Thompson]]. The image by Jaap van den Herik from the Award giving ceremony during [[ACM 1991]], November 20, 1991, [https://en.wikipedia.org/wiki/Albuquerque%2C_New_Mexico Albuquerque], [https://en.wikipedia.org/wiki/New_Mexico New Mexico], published in [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]] <ref>The Board of ICCA ('''1991'''). ''The Mephisto Best-Publication Award''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]], pp. 211</ref>, the same issue also containes a condensed version of the paper <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1991'''). ''Learning in Bebe.'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
[[FILE:LearningInBeBe.jpg|none|border|text-bottom|560px]]
[[Linda Scherzer]] with the Award <ref>[[Linda Scherzer]] with the Award (a [[Mephisto Vancouver]] ?)</ref>, [[ICCA]] representant [[Tony Marsland]], and [[Tony Scherzer]] .
=See also=
* [[Various Classifications#GivenName|Given Name]]
* [[Odd-Even Effect]]
* [[Persistent Hash Table]]
=Publications=
* Editor ('''1979'''). ''Scuffle in a Corner''. [[Personal Computing#3_8|Personal Computing, Vol. 3, No. 8]], pp. 76 » [[ACM 1978]], [[Sargon]]
* [[Tony Scherzer]] ('''1979'''). ''Background on BB-1''. [[Personal Computing#3_11|Personal Computing, Vol. 3, No. 11]], pp. 80
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]] » [[BeBe#Award|Mephisto Best-Publication Award]]
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1991'''). ''Learning in Bebe.'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess/wkTUUFfEvIE/RyFnJTjyQq4J Machine Learning Experience] by [[Michael Valvo|Mike Valvo]], [[Computer Chess Forums|rgc]], January 22, 1990
* [https://www.stmintz.com/ccc/index.php?id=71765 Bebe and Belle] by Joshua Lee, [[CCC]], October 04, 1999 » [[Belle]]
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=350 Bebe's ICGA Tournaments]
==Misc==
* [http://en.wiktionary.org/wiki/bebe bebe - Wiktionary]
* [http://en.wiktionary.org/wiki/beb%C3%A9 bebé - Wiktionary]
* [https://en.wikipedia.org/wiki/Bebe Bebe from Wikipedia] (Disambiguation page)
=References=
<references />
'''[[Engines|Up one level]]'''
