An introduction to the game of hex
- UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
- Steven Daniel Simmons (Creator)
- Institution
- The University of North Carolina at Greensboro (UNCG )
- Web Site: http://library.uncg.edu/
- Advisor
- Hughes Hoyle
Abstract: Hex is a tree game (defined in chapter II) with several interesting properties. Hex never ends in a draw. Either White, the player who moves first, or Black, the other player, can force a win. If Black can force a win, then White can force a win. This leads to the conclusion that White can force a win. All of this is established in chapter II. Although it Is known that White can force a win if he plays correctly, a winning strategy for the general n x n Hex game, where n is any positive integer, has yet to be discovered. Chapter III investigates some basic principles of strategy and gives paired strategies for Hex games of sizes 2 x 2, 3 x 3, 4 x 4, and 5 x 5. In chapter IV some winning and losing opening moves for White are explored. And finally a winning strategy for White in a 7 x 7 Hex game is developed.
An introduction to the game of hex
PDF (Portable Document Format)
4826 KB
Created on 1/1/1970
Views: 337
Additional Information
- Publication
- Thesis
- Language: English
- Date: 1970
- Subjects
- Hex (Game)