Mini-Max Algorithm

Procedure

The simulation steps
  1. Two modes: Random and Manual. By default, the Random mode is loaded with a random graph.
  2. Enter the desired depth in the text area and click "Save" to create a binary tree structure.
  3. Click on a terminal node to add values to that node.
  4. Click "Find Path" to run the algorithm and display the results of the min-max algorithm. The left side shows a table with the node values, and the right side shows the iteration process.
  5. In Manual mode, users can create their own graph by clicking on the canvas.
  6. Select nodes and connect them to create a tree structure. Double-click on a terminal node to add values.
  7. Click "Find Path" to run the algorithm and display the results of the min-max algorithm. The left side shows a table with the node values, and the right side shows the iteration process.
  8. To create another graph, click the "Reset" button to clear the canvas and start a new.
Random

choose "Random" from the given options
Enter the depth and click on save button

game1.PNG

Binary tree structure is shown below

game2.PNG

Click on a terminal node to add values to that node.

game3.PNG

Click "Find Path" to run the algorithm and display the results of the min-max algorithm

game.PNG
Manual

choose "Manual" from the given options

gm1.PNG

Click on the canvas to create new nodes

gm2.PNG

Select the nodes to connect the edges

gm3.PNG

Doubleclick the terminal node to Add Values

gm4.PNG

Click "Find Path" to run the algorithm and display the results of the min-max algorithm. The left side shows a table with the node values, and the right side shows the iteration process.

gm5.PNG