Knowledge

Belle (chess machine)

Source ๐Ÿ“

33: 629: 636: 622: 650: 657: 643: 616: 949:. 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. 931:
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
944:
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
853:
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
840:
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.
932:
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.
911:
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
760:
Belle represents a move by defining a "from" square and a "to" square, using a โˆ†xy offset counter. The rook move above has an offset (2,0), while the bishop's is (2,2).
810:
A similar series of steps uses the move generator to test whether the pseudo-legal move is in fact legal. This ensures that the move does not place the moving side in
899:
In 1978, the second generation of Belle competed at the ACM Computer Chess Championships, winning with a perfect four wins in four games. In a pivotal game against
912: 896:
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.
547:, which would eventually become Belle. In competition, this early version encouraged Thompson to pursue a brute-force approach when designing Belle's hardware. 879:
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.
427: 795:
This offset is combined with the contents of the "from" register and moved to a 6-bit "to" register. These two registers fully describe a potential
119: 474: 849:
Belle's final incarnation was completed in 1980. It consisted of further improvements to the speed of move generation and evaluation.
555:
Belle's design underwent many changes throughout its lifetime. The initial chess program was rewritten to utilize move-vs-evaluation
78: 875:
Belle's alpha-beta algorithm was now implemented in microcode, controlling the move generator, evaluator, and transposition table.
766: 1202: 946: 803: 1324: 420: 1293: 1274: 42: 89: 543:
operating system, Ken Thompson turned his attention to computer chess. In summer 1972, he began work on a program for the
94: 471: 1262: 968: 478: 413: 1489: 988: 963: 900: 781: 464: 214: 923:
in eight moves, winning the game on move 41. During the game, Belle searched 160,000 positions per second.
893: 822:
Belle's second generation was completed in 1978. It implemented several improvements over its predecessor.
84: 109: 1357: 1317: 209: 159: 1484: 1415: 1378: 229: 1479: 1373: 520: 169: 344: 279: 104: 560: 1352: 1310: 916: 493: 124: 903:, the runner-up, Belle examined 5,000 positions per second, while Chess 4.7 examined 3,500. 940:
Because of its ability to generate and analyze many chess positions, Belle represented the
389: 915:
chess machine. In a tie-breaker for the world-champion title, Belle broke through Chaos's
865:
The evaluator could now examine square control, using 64 specialized circuits, as well as
796: 8: 1258: 973: 564: 513: 460: 448: 369: 114: 74: 67: 802:
A test circuit compares the move to the existing board to determine whether the move is
1180: 941: 774: 769:
to be used with software version of Belle on the PDP-11. His design had several steps:
501: 154: 99: 1229:
Heinz, E. A. (2001). "Self-play, deep search and diminishing returns - Ken Thompson".
1409: 1289: 1270: 1246: 1217: 978: 556: 467: 384: 164: 1208:
Levy, D.; Mittman, B.; Newborn, M. (1980). "3rd World Computer Chess Championship".
1399: 1238: 334: 294: 509: 309: 137: 1421: 1176: 958: 866: 785: 444: 329: 319: 314: 182: 141: 54: 24: 1473: 1250: 1221: 811: 528: 399: 374: 359: 289: 224: 1333: 1242: 789: 452: 354: 247: 194: 269: 259: 830:, which it used to store moves, rather than outputting them to software. 523:. The overall architecture of Belle was used for the initial designs of 859: 827: 496:
for move generation, four custom boards for position evaluation, and a
339: 274: 204: 485: 1437: 983: 920: 497: 456: 394: 379: 324: 299: 284: 254: 32: 855: 524: 505: 489: 481:. It was the first system to win using specialized chess hardware. 199: 806:. If it is, the "from" and "to" registers are output to software. 149: 1442: 1302: 544: 349: 304: 264: 234: 219: 892:
Ken Thompson's software version of Belle competed in the 1972
833:
A hardware implementation of the position evaluator was added.
1458: 364: 1404: 1347: 540: 49: 784:
provides a bit-code for the move offset, e.g. (2,2) for a
492:
to coordinate its chess hardware. There were three custom
1195:
Condon, J.H. and K. Thompson, "Belle Chess Hardware", In
1286:
Kasparov versus Deep Blue: computer chess comes of age
836:
A hardware implementation of the transposition memory.
1265:(1983). "Chapter 9: Belle". In Frey, Peter W. (ed.). 1122: 1120: 519:At the end of its career, Belle was donated to the 1207: 1117: 1047: 1045: 780:Once a friendly piece is found, a โˆ†xy move-offset 989:Pawnless chess endgame ยง Browne versus BELLE 1471: 576: 1269:. New York: Springer-Verlag. pp. 201โ€“210. 1042: 872:The transposition memory was increased to 1 Mb. 459:. In 1983, it was the first machine to achieve 1257: 1175: 567:to avoid redundant examinations of positions. 1318: 421: 765:In 1976, Joe Condon implemented a hardware 1325: 1311: 1026: 1024: 1022: 570: 475:North American Computer Chess Championship 428: 414: 1199:(ed. M.R.B.Clarke), Pergamon Press, 1982. 628: 484:In its final incarnation, Belle used an 1283: 1019: 935: 777:searches the board for friendly pieces. 635: 621: 559:and evaluate positions by prioritizing 1472: 649: 1306: 1228: 906: 887: 656: 642: 612: 90:Efficiently updatable neural networks 19:This article is part of the series on 817: 844: 13: 969:Ken Thompson (computer programmer) 14: 1501: 479:World Computer Chess Championship 1332: 964:Glossary of computer chess terms 926: 655: 648: 641: 634: 627: 620: 614: 95:Handcrafted evaluation functions 31: 1156: 1147: 1138: 1129: 1108: 1099: 1090: 826:The move generator had its own 1267:Chess Skill in Man and Machine 1081: 1072: 1063: 1054: 1033: 1010: 1001: 1: 1169: 1197:Advances in Computer Chess 3 894:U.S. Open Chess Championship 504:. The computer also had one 7: 952: 110:Stochastic gradient descent 10: 1506: 539:Following his work on the 534: 160:Principal variation search 1451: 1430: 1387: 1366: 1340: 1284:Newborn, Monroe. (1997). 1210:Communications of the ACM 882: 550: 994: 477:five times and the 1980 1490:One-of-a-kind computers 1431:Associated institutions 1203:Computer History Museum 919:and went on to declare 571:Hardware move generator 521:Smithsonian Institution 170:Monte Carlo tree search 1288:. New York: Springer. 1243:10.3233/ICG-2001-24205 447:that was developed by 280:Dragon by Komodo Chess 105:Reinforcement learning 1367:Programming languages 1353:Plan 9 from Bell Labs 1181:"Ken, Unix and Games" 125:Unsupervised learning 43:Board representations 1162:Newborn 1997 p. 123. 1135:Newborn 1997 p. 122. 1007:Newborn 1997 p. 147. 936:Performance analysis 563:. Belle also used a 527:, the progenitor of 514:transposition tables 470:of 2250. It won the 75:Deep neural networks 68:Evaluation functions 1126:Newborn 1997 p. 92. 1096:Newborn 1997 p. 98. 1087:Newborn 1997 p. 93. 1016:Newborn 1997 p. 91. 974:Joseph Henry Condon 565:transposition table 115:Supervised learning 100:Piece-square tables 917:Alekhine's Defense 907:World Championship 888:Early competitions 561:material advantage 502:alpha-beta pruning 500:implementation of 155:Alpha-beta pruning 1467: 1466: 1341:Operating systems 1295:978-0-387-94820-1 1276:978-0-387-90815-1 1259:Condon, Joseph H. 1153:Heinz 2001 p. 76. 1144:Frey 1983 p. 209. 1114:Levy 1980 p. 664. 1105:Levy 1980 p. 663. 1078:Frey 1983 p. 207. 1069:Frey 1983 p. 206. 1060:Frey 1983 p. 205. 1051:Frey 1983 p. 204. 1039:Frey 1983 p. 203. 1030:Frey 1983 p. 202. 979:Endgame tablebase 818:Second generation 754: 753: 557:quiescence search 438: 437: 165:Quiescence search 144:search algorithms 25:Chess programming 1497: 1485:History of chess 1327: 1320: 1313: 1304: 1303: 1299: 1280: 1254: 1225: 1192: 1163: 1160: 1154: 1151: 1145: 1142: 1136: 1133: 1127: 1124: 1115: 1112: 1106: 1103: 1097: 1094: 1088: 1085: 1079: 1076: 1070: 1067: 1061: 1058: 1052: 1049: 1040: 1037: 1031: 1028: 1017: 1014: 1008: 1005: 845:Third generation 757:Defining a move. 659: 658: 652: 651: 645: 644: 638: 637: 631: 630: 624: 623: 618: 617: 577: 488:general-purpose 430: 423: 416: 335:Leela Chess Zero 35: 16: 15: 1505: 1504: 1500: 1499: 1498: 1496: 1495: 1494: 1480:Chess computers 1470: 1469: 1468: 1463: 1447: 1426: 1383: 1362: 1336: 1331: 1296: 1277: 1216:(11): 661โ€“664. 1172: 1167: 1166: 1161: 1157: 1152: 1148: 1143: 1139: 1134: 1130: 1125: 1118: 1113: 1109: 1104: 1100: 1095: 1091: 1086: 1082: 1077: 1073: 1068: 1064: 1059: 1055: 1050: 1043: 1038: 1034: 1029: 1020: 1015: 1011: 1006: 1002: 997: 955: 938: 929: 909: 890: 885: 847: 820: 788:or (2,0) for a 773:A 6-bit "from" 763: 762: 761: 759: 661: 660: 653: 646: 639: 632: 625: 615: 573: 553: 537: 451:(hardware) and 434: 405: 404: 250: 240: 239: 185: 183:Chess computers 175: 174: 145: 130: 129: 70: 60: 59: 45: 12: 11: 5: 1503: 1493: 1492: 1487: 1482: 1465: 1464: 1462: 1461: 1455: 1453: 1449: 1448: 1446: 1445: 1440: 1434: 1432: 1428: 1427: 1425: 1424: 1422:Thompson shell 1419: 1412: 1407: 1402: 1397: 1391: 1389: 1385: 1384: 1382: 1381: 1376: 1370: 1368: 1364: 1363: 1361: 1360: 1355: 1350: 1344: 1342: 1338: 1337: 1330: 1329: 1322: 1315: 1307: 1301: 1300: 1294: 1281: 1275: 1255: 1226: 1205: 1200: 1193: 1177:Dennis Ritchie 1171: 1168: 1165: 1164: 1155: 1146: 1137: 1128: 1116: 1107: 1098: 1089: 1080: 1071: 1062: 1053: 1041: 1032: 1018: 1009: 999: 998: 996: 993: 992: 991: 986: 981: 976: 971: 966: 961: 959:Computer chess 954: 951: 937: 934: 928: 925: 908: 905: 889: 886: 884: 881: 877: 876: 873: 870: 867:pawn structure 863: 846: 843: 838: 837: 834: 831: 819: 816: 808: 807: 800: 793: 778: 767:move generator 755: 752: 751: 749: 746: 743: 740: 737: 734: 731: 728: 725: 722: 721: 718: 714: 713: 710: 706: 705: 702: 698: 697: 694: 690: 689: 686: 682: 681: 678: 674: 673: 670: 666: 665: 662: 654: 647: 640: 633: 626: 619: 613: 611: 607: 606: 604: 601: 598: 595: 592: 589: 586: 583: 580: 575: 574: 572: 569: 552: 549: 536: 533: 455:(software) at 445:chess computer 436: 435: 433: 432: 425: 418: 410: 407: 406: 403: 402: 397: 392: 387: 382: 377: 372: 367: 362: 357: 352: 347: 342: 337: 332: 327: 322: 317: 312: 307: 302: 297: 292: 287: 282: 277: 272: 267: 262: 257: 251: 246: 245: 242: 241: 238: 237: 232: 227: 222: 217: 212: 207: 202: 197: 192: 186: 181: 180: 177: 176: 173: 172: 167: 162: 157: 152: 146: 136: 135: 132: 131: 128: 127: 122: 117: 112: 107: 102: 97: 92: 87: 82: 71: 66: 65: 62: 61: 58: 57: 52: 46: 41: 40: 37: 36: 28: 27: 21: 20: 9: 6: 4: 3: 2: 1502: 1491: 1488: 1486: 1483: 1481: 1478: 1477: 1475: 1460: 1457: 1456: 1454: 1450: 1444: 1441: 1439: 1436: 1435: 1433: 1429: 1423: 1420: 1418: 1417: 1413: 1411: 1408: 1406: 1403: 1401: 1398: 1396: 1393: 1392: 1390: 1386: 1380: 1377: 1375: 1372: 1371: 1369: 1365: 1359: 1356: 1354: 1351: 1349: 1346: 1345: 1343: 1339: 1335: 1328: 1323: 1321: 1316: 1314: 1309: 1308: 1305: 1297: 1291: 1287: 1282: 1278: 1272: 1268: 1264: 1263:Thompson, Ken 1260: 1256: 1252: 1248: 1244: 1240: 1236: 1232: 1227: 1223: 1219: 1215: 1211: 1206: 1204: 1201: 1198: 1194: 1190: 1186: 1182: 1179:(June 2001). 1178: 1174: 1173: 1159: 1150: 1141: 1132: 1123: 1121: 1111: 1102: 1093: 1084: 1075: 1066: 1057: 1048: 1046: 1036: 1027: 1025: 1023: 1013: 1004: 1000: 990: 987: 985: 982: 980: 977: 975: 972: 970: 967: 965: 962: 960: 957: 956: 950: 948: 943: 933: 927:Master rating 924: 922: 918: 914: 904: 902: 897: 895: 880: 874: 871: 868: 864: 861: 857: 852: 851: 850: 842: 835: 832: 829: 825: 824: 823: 815: 813: 805: 801: 798: 794: 791: 787: 783: 779: 776: 772: 771: 770: 768: 758: 750: 747: 744: 741: 738: 735: 732: 729: 726: 724: 723: 719: 716: 715: 711: 708: 707: 703: 700: 699: 695: 692: 691: 687: 684: 683: 679: 676: 675: 671: 668: 667: 663: 609: 608: 605: 602: 599: 596: 593: 590: 587: 584: 581: 579: 578: 568: 566: 562: 558: 548: 546: 542: 532: 530: 529:IBM Deep Blue 526: 522: 517: 515: 511: 507: 503: 499: 495: 491: 487: 482: 480: 476: 473: 469: 466: 463:play, with a 462: 458: 454: 450: 446: 442: 431: 426: 424: 419: 417: 412: 411: 409: 408: 401: 398: 396: 393: 391: 388: 386: 383: 381: 378: 376: 373: 371: 368: 366: 363: 361: 358: 356: 353: 351: 348: 346: 343: 341: 338: 336: 333: 331: 328: 326: 323: 321: 318: 316: 313: 311: 308: 306: 303: 301: 298: 296: 293: 291: 288: 286: 283: 281: 278: 276: 273: 271: 268: 266: 263: 261: 258: 256: 253: 252: 249: 248:Chess engines 244: 243: 236: 233: 231: 228: 226: 223: 221: 218: 216: 213: 211: 208: 206: 203: 201: 198: 196: 193: 191: 188: 187: 184: 179: 178: 171: 168: 166: 163: 161: 158: 156: 153: 151: 148: 147: 143: 139: 134: 133: 126: 123: 121: 118: 116: 113: 111: 108: 106: 103: 101: 98: 96: 93: 91: 88: 86: 83: 80: 76: 73: 72: 69: 64: 63: 56: 53: 51: 48: 47: 44: 39: 38: 34: 30: 29: 26: 23: 22: 18: 17: 1416:Space Travel 1414: 1394: 1334:Ken Thompson 1285: 1266: 1237:(2): 75โ€“79. 1234: 1231:ICGA Journal 1230: 1213: 1209: 1196: 1188: 1185:ICGA Journal 1184: 1158: 1149: 1140: 1131: 1110: 1101: 1092: 1083: 1074: 1065: 1056: 1035: 1012: 1003: 947:search depth 939: 930: 910: 898: 891: 878: 848: 839: 821: 809: 804:pseudo-legal 764: 756: 554: 538: 518: 512:for storing 483: 461:master-level 453:Ken Thompson 440: 439: 215:Deep Thought 195:ChessMachine 189: 120:Texel tuning 79:Transformers 942:brute-force 270:CuckooChess 260:Chess Tiger 1474:Categories 1170:References 860:en passant 449:Joe Condon 340:MChess Pro 275:Deep Fritz 205:Cray Blitz 1438:Bell Labs 1251:1389-6911 1222:0001-0782 984:Bell Labs 921:checkmate 901:Chess 4.7 498:microcode 457:Bell Labs 395:Turochamp 385:Stockfish 380:SmarThink 325:KnightCap 300:GNU Chess 285:Fairy-Max 255:AlphaZero 210:Deep Blue 85:Attention 55:Bitboards 1388:Software 953:See also 856:castling 775:register 525:ChipTest 506:megabyte 490:computer 370:Shredder 230:Mephisto 200:ChipTest 1358:Inferno 782:counter 535:Origins 345:Mittens 310:Houdini 150:Minimax 1443:Google 1292:  1273:  1249:  1220:  883:Career 786:bishop 551:Design 545:PDP-11 510:memory 494:boards 486:LSI-11 468:rating 350:MuZero 330:Komodo 320:Junior 315:Ikarus 305:HIARCS 265:Crafty 235:Saitek 220:HiTech 1459:UTF-8 1452:Other 1395:Belle 995:Notes 913:Chaos 828:stack 812:check 443:is a 441:Belle 400:Zappa 390:Torch 375:Sjeng 365:Rybka 360:REBEL 295:Fruit 290:Fritz 225:Hydra 190:Belle 138:Graph 1405:grep 1348:Unix 1290:ISBN 1271:ISBN 1247:ISSN 1218:ISSN 1191:(2). 858:and 797:move 790:rook 541:Unix 465:USCF 355:Naum 142:tree 140:and 50:0x88 1410:sam 1239:doi 508:of 472:ACM 1476:: 1400:ed 1379:Go 1261:; 1245:. 1235:24 1233:. 1214:23 1212:. 1189:24 1187:. 1183:. 1119:^ 1044:^ 1021:^ 814:. 531:. 516:. 1374:B 1326:e 1319:t 1312:v 1298:. 1279:. 1253:. 1241:: 1224:. 869:. 862:. 799:. 792:. 748:h 745:g 742:f 739:e 736:d 733:c 730:b 727:a 720:1 717:1 712:2 709:2 704:3 701:3 696:4 693:4 688:5 685:5 680:6 677:6 672:7 669:7 664:8 610:8 603:h 600:g 597:f 594:e 591:d 588:c 585:b 582:a 429:e 422:t 415:v 81:) 77:(

Index

Chess programming

Board representations
0x88
Bitboards
Evaluation functions
Deep neural networks
Transformers
Attention
Efficiently updatable neural networks
Handcrafted evaluation functions
Piece-square tables
Reinforcement learning
Stochastic gradient descent
Supervised learning
Texel tuning
Unsupervised learning
Graph
tree
Minimax
Alpha-beta pruning
Principal variation search
Quiescence search
Monte Carlo tree search
Chess computers
Belle
ChessMachine
ChipTest
Cray Blitz
Deep Blue

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

โ†‘