University of Alberta
5 reports, presentations and talks by University of Alberta in the Game Industry Library, the newest “Solving 7x7 Hex: Virtual Connections and Game-State Reduction” (2004).
Documents
Solving 7x7 Hex: Virtual Connections and Game-State Reduction
The game of Hex presents a significant computational challenge due to its PSPACE-complete nature, which necessitates advanced strategies to navigate its vast state space.
First Experimental Results of ProbCut Applied to Chess
This research explores the application of ProbCut and Multi-ProbCut (MPC) heuristics to computer chess, aiming to enhance the standard alpha-beta search algorithm.
Solving the Oshi-Zumo Game
The Japanese game Oshi-Zumo, a two-player, zero-sum game of incomplete information, is analyzed to determine its Nash-optimal mixed strategies.
Evaluation Function Tuning via Ordinal Correlation
Static evaluation functions in computer chess are most effectively optimized by prioritizing the relative ordering of positions rather than the absolute numerical values assigned to them.
Building the Checkers 10-Piece Endgame Databases
The computation of 10-piece checkers endgame databases represents a significant milestone in computational game theory, providing a foundational step toward the definitive weak solution of the game.
Do you work at University of Alberta? Get a free report of how these documents are read and cited here.