Chess and the computer

Update Item Information
Publication Type honors thesis
School or College College of Science
Department Mathematics
Creator Jennings, Lynn Mansfield
Title Chess and the computer
Date 1971-12-27
Year graduated 1971
Description The complexity and logic involved in playing chess has fascinated mathematicians for many years. Gauss and other theorists spent years working out chess problems. The ultimate problem naturally is: How is the perfect game of chess played? Because of the fantastic number of possibilities and combinations involved, little headway has been made in forming a solution. For example, consider the problem of :Eight Queens". Gauss originally proposed seventy six possible solutions. By 1876, some forty years later, forty-two different solutions had been found by chess masters. Konig, using graph theory techniques, easily demonstrates ninety-two possible; solutions. He also proves ninety-two answers the above question.
Type Text
Publisher University of Utah
Subject Chess
Language eng
Rights Management (c) Lynn Mansfield Jennings
Format Medium application/pdf
ARK ark:/87278/s61g4qkg
Setname ir_htca
ID 1328029
Reference URL https://collections.lib.utah.edu/ark:/87278/s61g4qkg
Back to Search Results