A VLSI Chess Legal Move Generator
Constructing a chess legal move generator (LMG) illustrates the design and evaluar tion of a variety of algorithms and the problems encountered implementing them in VLSI. Software-based algorithms for LMG and their possible hardware implementations are examined. Several new approaches exploiting parallelism and systolic structure are developed. The implementations of several algorithms are compared: the space, time, complexity, and feasibility tradeoffs provide interesting insights into the development of custom-designed VLSI circuits for non-numeric applications.
KeywordsSorting Tame Goldwater
Unable to display preview. Download preview PDF.
- R.P. Gurd, User’s Reference to By University of Waterloo, 1982.Google Scholar
- Joe Condon and Ken Thompson, Belle Chess Hardware, Advances in Computer Chess 3, 1982, Pergammon Press, M.R.B. Clarke (ed.).Google Scholar
- Andy Soltis, Four Roads to Success, Chess Life and Review, February, 1981.Google Scholar
- Peter Frey, (ed.). Chess Skill in Man and Machine, Springer-Verlag, 1975.Google Scholar
- John Mick and Jim Brick, Bit-Slice Microprocessor Design, McGraw-Hill, 1980.Google Scholar
- Leonard S. Haynes, Richard L. Lau, Daniel P. Siewiorek, and Daniel Mizell, A survey of highly parallel computing. Computer 15(No. 1), January, 1982.Google Scholar
- Carver Mead and Lynne Conway, Introduction to VLSI Systems, Addison-Wesley, 1980.Google Scholar
- Dave Johannsen, Bristle Blocks: A Silicon Compiler, Proceedings of the 16th Design Automation Conference, 1979.Google Scholar
- Uri Weiser and Al Davis, A wavefront notation tool for VLSI array design, CMU Conference on VLSI Systems and Computations, October 19–21, 1981, Computer Science Press, H.T. Kung, Bob Sproull, Guy Steel (eds.).Google Scholar
- Greg Bakker, Jim Jonkman, Jonathan Schaeffer, and Tom Schultz, VLSI Implementation of a Chess Legal Move Generator, EE755S-1, University of Waterloo, August, 1982.Google Scholar