Three dimensional Four in a Row game with computer AI using Monte Carlo Tree Search (MCTS) with UCB (Upper Confidence Bounds) applied to trees (UCT in short).
- Start a session in browser on http://omerkel.github.io/FourInARow3D/html5/src/
- Android APK available for install https://github.com/OMerkel/FourInARow3D/releases
Keywords, Categories Monte-Carlo-Tree-Search (MCTS), Upper-Confidence-Bounds (UCB), UCT, Artificial Intelligence (AI), Board Game, Abstract Game, Perfect Information, 2 Player Strategy Game, Two Player, Games/Entertainment, Mobile, Mobile App, JavaScript, ECMAScript
Abstract
This Four in a Row 3D board game demonstrates the use of the Artificial Intelligence method Monte Carlo Tree Search with UCB (Upper Confidence Bounds) applied to trees (UCT in short). Four in a Row 3D is a two player abstract strategy game with perfect information. This implementation allows any combination of human players and artificial intelligence players as chosen from the options menu.
Rules
Two players place beads of their own color on a selected pole of their choice during their turn. The game is played in alternating the player's turn between the two players. The player controlling the red beads starts the game. Passing a turn is not allowed.
First player with four beads of own color in a row wins. Building a row can be done in any direction inside the grid of 64 positions in straight line.
3rd Party Libraries
- jQuery: MIT licensed, https://github.com/jquery/jquery
- jQuery UI: MIT licensed, https://github.com/jquery/jquery-ui
- Snap.svg: Apache License V2.0 licensed, https://github.com/adobe-webplatform/Snap.svg
Contributors / Authors
Oliver Merkel, |
All logos, brands and trademarks mentioned belong to their respective owners.