Skip to content

angad-kalra/AlphaBetaMinimax

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

AlphaBetaMinimax

The code implements Minimax algorithm with Alpha-Beta pruning and gives the best next move for the specified player.
Input :
Player i.e. X or O
Board configuration
Output:
Next selected move

Testcase:
Input:
X
XXO
XO_
_OX
Output:
2 0

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages