Belle (chess machine)

Following his work on the Unix operating system, Ken Thompson turned his attention to computer chess. In summer 1972, he began work on a program for the PDP-11, which would eventually become Belle. In competition, this early version encouraged Thompson to pursue a brute-force approach when designing Belle's hardware. ==Design==

Belle's design underwent many changes throughout its lifetime. The initial chess program was rewritten to utilize move-vs-evaluation quiescence search and evaluate positions by prioritizing material advantage. Belle also used a transposition table to avoid redundant examinations of positions. Second generation Belle's second generation was completed in 1978. It implemented several improvements over its predecessor. • The move generator had its own stack, which it used to store moves, rather than outputting them to software. • A hardware implementation of the position evaluator was added. • A hardware implementation of the transposition memory. These changes reduced the role of the PDP-11 software. Now, the software controlled these three devices and ran the alpha-beta pruning algorithm. The second generation of Belle could search 5,000 positions per second. Third generation Belle's final incarnation was completed in 1980. It consisted of further improvements to the speed of move generation and evaluation. • The move generator now included 64 transmitter and receiver circuits. Each transmitter remembered the piece on its square and potential moves that piece could make. Each receiver detected incoming moves, or threats, from other pieces. Extra circuitry detected castling and en passant. • The evaluator could now examine square control, using 64 specialized circuits, as well as pawn structure. • The transposition memory was increased to 1 Mb. • Belle's alpha-beta algorithm was now implemented in microcode, controlling the move generator, evaluator, and transposition table. The third generation of Belle was controlled by an LSI-11 computer. Depending on the stage of the game, it examined 100,000 to 200,000 moves per second. ==Career==

Early competitions Ken Thompson's software version of Belle competed in the 1972 U.S. Open Chess Championship and the 1973 ACM Computer Chess Championship. Over the next year, Belle played several UCSF games and finished 3-1 in the 1974 ACM Computer Chess Championship. In 1978, the second generation of Belle competed at the ACM Computer Chess Championships, winning with a perfect four wins in four games. World Championship In 1980, the third generation of Belle won the third World Computer Chess Championship in Linz, Austria. After four rounds, it had a score of 3.5 in four games, tied with the CHAOS chess program. In a tie-breaker for the world-champion title, Belle broke through CHAOS' Alekhine's Defense and went on to declare checkmate in eight moves, winning the game on move 41. During the game, Belle searched 160,000 positions per second. In 1982, the United States Customs Service impounded Belle for violating the Export Control Act as Thompson attempted to travel with it to the Soviet Union for a chess exhibition. Thompson said that the computer was made of commercial off-the-shelf components, and that its only military use was "to drop it out of an airplane. You might kill somebody that way". Master rating In 1983, Belle competed in the U.S. Open, where it scored 8.5 points in twelve games with a performance rating of 2363. Later that year, the USCF awarded Belle the rank of master. Because it reached this level before any other chess computer, Belle was awarded the $5,000 Fredkin prize. Belle's reign ended when it placed sixth in the Fourth World Computer Chess Championship, despite being the favorite to win. It managed one more win at the ACM Championships in 1986 before retiring. ==Performance analysis==

Because of its ability to generate and analyze many chess positions, Belle represented the brute-force approach to chess computing. In the late 1970s, Thompson became interested in the limits of this method, playing different versions of Belle against one another. Using identical machines allowed him to minimize effects of the individual machine's play style while isolating the effects of search depth. For instance, if one Belle computer searches three levels deep, the other might search to four. Thompson concluded that for each additional level of search, Belle improved by approximately 250 rating points. This effect has been replicated in self-play experiments with different machines. Beyond 2,000 points, however, Thompson found that improvements leveled off. ==See also==