Hex: The Full Story is for anyone - hobbyist, professional, student, teacher - who enjoys board games, game theory, discrete math, computing, or history. hex was discovered twice, in 1942 by Piet Hein and again in 1949 by John F. nash. How did this happen? Who created the puzzle for Hein's Danish newspaper column? How are Martin Gardner, David Gale, Claude Shannon, and Claude Berge involved? What is the secret to playing Hex well? The answers are inside... Features New documents on Hein's creation of Hex, the complete set of Danish puzzles, and the identity of their composer Chapters on Gale's game Bridg-it, the game Rex, computer Hex, open Hex problems, and more Dozens of new puzzles and solutions Study guide for Hex players Supplemenetary text for a course in game theory, discrete math, computer science, or science history

Hex Strategy is the first book to offer a comprehensive look at the game of Hex, from its history and mathematical underpinnings to discussions of advanced playing techniques. This is first and foremost a book on strategy aimed at providing sufficient knowledge to play the game at any level desired. Numerous examples illustrate an algorithmic approach to the game. Hex Strategy is a book for board game enthusiasts, recreational mathematicians and programmers, or simply those who enjoy games and puzzles.

The history of mathematics is filled with major breakthroughs resulting from solutions to recreational problems. Problems of interest to gamblers led to the modern theory of probability, for example, and surreal numbers were inspired by the game of Go. Yet even with such groundbreaking findings and a wealth of popular-level books exploring puzzles and brainteasers, research in recreational mathematics has often been neglected. The Mathematics of Various Entertaining Subjects brings together authors from a variety of specialties to present fascinating problems and solutions in recreational mathematics. Contributors to the book show how sophisticated mathematics can help construct mazes that look like famous people, how the analysis of crossword puzzles has much in common with understanding epidemics, and how the theory of electrical circuits is useful in understanding the classic Towers of Hanoi puzzle. The card game SET is related to the theory of error-correcting codes, and simple tic-tac-toe takes on a new life when played on an affine plane. Inspirations for the book's wealth of problems include board games, card tricks, fake coins, flexagons, pencil puzzles, poker, and so much more. Looking at a plethora of eclectic games and puzzles, The Mathematics of Various Entertaining Subjects is sure to entertain, challenge, and inspire academic mathematicians and avid math enthusiasts alike.

Combinatorial games are the strategy games that people like to play, for example chess, Hex, and Go. They differ from economic games in that there are two players who play alternately with no hidden cards and no dice. These games have a mathematical structure that allows players to analyse them in the abstract. Games of No Chance 4 contains the first comprehensive explorations of misère (last player to move loses) games, extends the theory for some classes of normal-play (last player to move wins) games and extends the analysis for some specific games. It includes a tutorial for the very successful approach to analysing misère impartial games and the first attempt at using it for misère partisan games. Hex and Go are featured, as well as new games: Toppling Dominoes and Maze. Updated versions of Unsolved Problems in Combinatorial Game Theory and the Combinatorial Games Bibliography complete the volume.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Computers and Games, CG 2013, held in Yokohama, Japan, in August 2013, in conjunction with the 17th Computer and Games Tournament and the 20th World Computer-Chess Championship. The 21 papers presented were carefully reviewed and selected for inclusion in this book. They cover a wide range of topics which are grouped into five classes: Monte Carlo Tree Search and its enhancements; solving and searching; analysis of game characteristic; new approaches; and serious games.

A comprehensive study of the connection game genre, Connection Games provides a survey of known connection games while exploring common themes and strategies. This book aims to impose some structure on this increasingly large family of games, and to define exactly what constitutes a connection game. Key games are examined in detail and complete rul