Skip to content

Tic-Tac-Toe with Monte Carlo Tree Search and MiniMax Alpha-beta pruning algorithms in C

Notifications You must be signed in to change notification settings

ReconGit/c-tictactoe-ai

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A simple Tic-Tac-Toe game implemented in C, featuring Monte Carlo Tree search and MiniMax algorithm with Alpha-Beta pruning optimization that prioritizes winning in the shortest possible depth.

Compile with Makefile using "make" or "make all" command in terminal to compile both game and tests, to compile them separately use "make game" or "make tests". Files will be compiled to bin/ directory.

After successful compilation, you can play the game by typing "./bin/game" in terminal, type "./bin/tests" to run tests.

All tests were written using "greatest" testing library for C.

To quit the game during playing enter Q or q.

About

Tic-Tac-Toe with Monte Carlo Tree Search and MiniMax Alpha-beta pruning algorithms in C

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published