Skip to content

Latest commit

 

History

6 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

Repository files navigation

MiniMax Algorithm

How to use algorithm

  1. Instantiate GameTree , tree = GameTree()

  2. Construct the tree , tree.constructTree() # creates game tree of specified depth with randomized utilities at each terminal state

  3. run the algorithm on tree, tree.minimax() # computes the decision at the root node and all decisions at each level

  4. print out utilities at each terminal state, tree.dfs() # performs a depth first search and prints all utility values

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages