|Chip Hollingsworth d6d3bd7ed4 Fixed base URL for axios calls||2 years ago|
|client||2 years ago|
|gradle/wrapper||2 years ago|
|src||2 years ago|
|.gitignore||2 years ago|
|LICENSE||2 years ago|
|README.md||2 years ago|
|build.gradle||2 years ago|
|gradlew||2 years ago|
|gradlew.bat||2 years ago|
The Game of Y, implemented in Java with Spring Boot
Almost as long as I’ve been interested in programming artificial intelligence applications, I’ve had a mild obsession with the Game of Hex. As part of my research into the game and its strategy, I came across this paper, which introduced me to the Game of Y, and demonstrated that Hex can be thought of as a special case of the Game of Y. It also outlined a clever algorithm for calculating the winner, if any, of any given Y board (and therefore of any given Hex board).
This project is a simple implementation of the Game of Y, using Java and Spring Boot for the backend and Vue.js for the
frontend. The user is asked to select the size of the game board from a drop-down menu. With each move, the player has
the option to select the algorithm used to compute the computer’s next move from a menu. Currently, there are only two algorithms:
a “dumb” algorithm that just selects the next move completely at random, and a slightly smarter algorithm that uses repeated random playouts (Monte Carlo tree search) to determine the best move.