This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 1Algorithms
- 1Artificial intelligence
- 1Automated solver
- 1Combinatorial game theory
- 1Computer Hex
- 1Games
-
Fall 2022
Imperfect information games model many large-scale real-world problems. Hex is the classic two-player zero-sum no-draw connection game where each player wants to join their two sides. Dark Hex is an imperfect information version of Hex in which each player sees only their own moves. Finding Nash...
-
Fall 2015
We develop a method for searching for Hajós constructions. Our results include the discovery of new constructions for some well-known graphs, including the Grötzsch graph, Chvátal graph, and Brinkmann graph; also, we prove that the first two of these are shortest possible constructions. These are...
-
Fall 2010
The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is intrinsically tied to the Four Colour Theorem and the well-known strategy-stealing argument. Nash, Shannon, Tarjan, and Berge are...
-
Spring 2020
Two-Player alternate-turn perfect-information zero-sum games have been suggested as a testbed for Artificial Intelligence research since Shannon in 1950s. In this thesis, we summarize and develop algorithms for this line of research. We focus on the game of Hex — a game created by Piet Hein in...