Abstract
Researchers who first described how computers might be programmed to play chess were talking about machines costing millions of dollars. These machines occupied entire laboratories, ran on vacuum tubes or mechanical relays, required large amounts of electricity, generated vast amounts of heat, and failed at intervals measured in minutes or hours. They executed approximately 10,000 instructions per second, compared with 10,000,000 or more on some big fast machines currently available. They had to be programmed in machine language, a language that must have driven a certain number of programmers in the 1950’s into a permanent state of insanity. Memory space was measured in bits rather than in kilowords as it is now, thereby placing severe restrictions on the size of programs. Finding mistakes in programs was a tremendous task. Programmers complained that their programs failed because of hardware problems while the technicians called in to find the mysterious bugs countered that the problems were with the programs. The two were always seen working together and blaming each other for their own woes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Available through Computer Game Programs, 1700 Ohio Savings Plaza, 1801 East Ninth St., Cleveland, Ohio 44114.
Rights and permissions
Copyright information
© 1982 Computer Science Press, Inc.
About this chapter
Cite this chapter
Levy, D., Newborn, M. (1982). Microcomputers and Chess. In: All About Chess and Computers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85538-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-85538-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85540-5
Online ISBN: 978-3-642-85538-2
eBook Packages: Springer Book Archive