Mastering Quoridor
@inproceedings{Glendenning2002MasteringQ,
title={Mastering Quoridor},
author={Lisa Glendenning},
year={2002}
}OF THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Bachelor of Science Computer Science The University of New Mexico Albuquerque, New Mexico
No Paper Link Available
Figures and Tables from this paper
figure 2.1 
table 2.1 
figure 2.10 
figure 2.11 
figure 2.12 
figure 2.14 
figure 2.15 
figure 2.16 
figure 2.17 
figure 2.2 
table 2.2 
figure 2.3 
figure 2.4 
figure 2.5 
figure 2.6 
figure 2.7 
figure 2.8 
figure 2.9 
figure 3.1 
figure 3.10 
table 3.1 
figure 3.11 
figure 3.12 
figure 3.13 
figure 3.2 
table 3.2 
figure 3.3 
figure 3.4 
figure 3.5 
figure 3.6 
figure 3.7 
figure 3.8 
figure 3.9 
table 4.1 
figure 4.1 
figure 4.2 
figure 4.3 
figure 4.4
4 Citations
An AlphaGo-Zero Inspired Quoridor Player Senior Project ( CPSC 490 )
- Computer Science
This work aims to develop a strong Quoridor computer player using an AlphaGo-Zero based framework and has limited the game to a board of 9x9 (including wall slots) with 3 walls per player instead of the usual 17x17 with 10 Walls per player.
Graph Games and Logic Design
- Computer Science
- 2020
This position paper discusses old and new graph games in tandem with matching logics and identifies general questions behind this match and proposes a perspective that complements existing game-theoretic and computational ones.
The MP-MIX Algorithm: Dynamic Search Strategy Selection in Multiplayer Adversarial Search
- Computer ScienceIEEE Transactions on Computational Intelligence and AI in Games
- 2011
The MaxN-paranoid mixture (MP-Mix) algorithm is suggested: a multiplayer adversarial search that switches search strategies according to the game situation and significantly outperforms MaxN and paranoid in various settings in all three games.
References
SHOWING 1-10 OF 29 REFERENCES
THE EVOLUTION OF MULAN: SOME STUDIES IN GAME-TREE PRUNING AND EVALUATION FUNCTIONS IN THE GAME OF AMAZONS
- Computer Science
- 2003
This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, as to provide real-time information about the response of the immune system to computer attacks.
Artificial Intelligence
- Computer ScienceIFIP Congress
- 1974
The history, the major landmarks, and some of the controversies in each of these twelve topics are discussed, as well as some predictions about the course of future research.
Infinite Cyclic Impartial Games
- MathematicsComputers and Games
- 1998
The family of locally path-bounded digraphs is defined, and it is shown that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and a win is realized, when possible, in a finite number of moves.
Selective depth-first game-tree search
- Computer Science
- 2002
It is shown how speculative pruning can, if applied in a controlled manner, improve the search efficiency of existing game-tree search algorithms—without compromising the returned minimax value.
An overview of evolutionary algorithms: practical issues and common pitfalls
- Computer ScienceInf. Softw. Technol.
- 2001
Loopy Games and Go
- Mathematics
- 1996
This theory of loopy games is reviewed and it is shown how it can be adapted to the two-person strategy game of Go, which also has the feature that situations involving infinitely long play often arise.
Artificial Intelligence: A Modern Approach
- Computer Science
- 1995
The long-anticipated revision of this #1 selling book offers the most comprehensive, state of the art introduction to the theory and practice of artificial intelligence for modern applications.…
An investigation, using co-evolution, to evolve an Awari player
- Computer Science, EconomicsProceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
- 2002
This work shows how an awari player can be evolved using a co-evolutionary approach where computer players play against one another, with the strongest players surviving and being mutated using an evolutionary strategy (ES).
A genetic algorithm tutorial
- Computer Science
- 1994
This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial…
An introduction to Conway’s games and numbers
- Mathematics
- 2004
Combinatorial Game Theory is a fascinating and rich theory, based on a simple and intuitive recursive definition of games, which yields a very rich algebraic structure: games can be added and…