https://github.com/afsalthaj/tic-tac-toe
https://github.com/afsalthaj/tic-tac-toe
minimax-algorithm object-oriented ruby tictactoe-game
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/afsalthaj/tic-tac-toe
- Owner: afsalthaj
- Created: 2017-08-10T01:29:36.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2017-09-21T12:15:11.000Z (almost 8 years ago)
- Last Synced: 2025-04-04T06:11:17.246Z (3 months ago)
- Topics: minimax-algorithm, object-oriented, ruby, tictactoe-game
- Language: Ruby
- Size: 69.3 KB
- Stars: 5
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
# My Tic-Tac-Toe in Ruby
This is a tic-tac-toe with a command line interface
that lets you play a tic-tac-toe with the computer.
The implementation is done in Ruby using the min-max algorithm.
# Start playing
* Install Ruby (Ex: In Mac, brew install ruby)
* Clone the project
```
git clone https://github.com/afsalthaj/tic-tac-toe
```
* Play game
```
cd tic-tac-toe
cd ui
ruby command_line_game.rb
```
# Strategy
* Computer plays all the future games the moment you start the game.
* Computer ranks all the moves, and depending the player, it choose the move
with either the maximum score, or minimum score. Maximum score if next move is "Computer's"
else minimum.
* The computer player is hard-coded as :X and the user is identified as :O
## Pros
* Minimax algorithm, from a high level perspective, is fairly intuitive
* It is always interesting to build a recursive algorithm.
* Less code.
## Cons
* Relatively a complex recursion once developed.
* First stage computations taking time. Depth factor can be incorporated.
# Game Runner
Game Runner is sort of a client of Tic tac toe `Game` that makes use
of the strategy and the game.
Game class is responsible for keeping track of the state of the game.
Obviously state of the game is represented by the player, the board and the
complete set of moves available at a point in time.
# Test Coverage
* All that I did here is, simulating a game in test case, and asserting each moves/possible moves.
* Asserting each move/possible move is done intuitively and did't focus much on min-max algorithm.
* File "game.rb" and "game_runner.rb" are the ones tested. File "play.rb" is just invoking the game.
Run tests by:
```shell
// In the root directory
// Optional command
brew install ruby
bundle install
//run tests
ruby spec.rb
// get the coverage report
cd coverage
open index.html
```
# Todo:
* It seems the algorithm selected is quite advanced, and is not scalable.
* The first iteration of every game starts in 20 seconds, which is not so good.
* The first selection of player carried over to the rest of the games. This is to be made flexible
* Mock command line input output testing rspec
# Reference
* https://www.quora.com/Is-there-a-simple-explanation-of-a-minimax-algorithm
* https://www.youtube.com/watch?v=zDskcx8FStA
* https://en.wikipedia.org/wiki/Minimax