Skip to content

bbipulroy/tic-tac-toe

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tic Tac Toe

Using-Alpha-Beta-Minimax-Search

This code demonstrates the use of Alpha Beta Pruning for Game playing. Since, Tic Tac Toe has a depth of 9, I use a heuristic function that evaluates the Board State after searching through a depth of 3. The heuristic function calculates the expected score of winning for the PC given the board state.

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages