1 / 6

The Project

The Project . And the few things I did Jacobus Harding. Core. The entire core of the project revolves around the minimax function. Two separate methods for clarity, pass back and forth to each other. Helper function, availableMoves (finds all open squares)

yorick
Télécharger la présentation

The Project

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Project And the few things I did Jacobus Harding

  2. Core • The entire core of the project revolves around the minimax function. • Two separate methods for clarity, pass back and forth to each other. • Helper function, availableMoves(finds all open squares) • Does well due to simplicity and speed through which I can traverse the minimax tree.

  3. Evaluate • Simple evaluation function • Checks nodes of minimax tree to see which are wins, which are losses. • Assigns very high, very low values for wins and losses respectively.

  4. Hueristics • At time of submission only one developed, working hueristic. • ForcedBlock • If a node contains an opponent setup with K-1 length(diagonal, horizontal, vertical) immediately stop minimax and block.

  5. IDFS • AI runs extremely slow without IDFS • After one or two moves, times out and error is thrown • Start at certain depth and work your way down if you have enough time • Keep track of time at highest level, before you get lost in the minimax tree so that you can break out simply.

  6. Further Improvements • More heuristics which generally evaluate the board state in each node. • Will decrease time spent on each node since pruning can take place, allowing for a longer DFS.

More Related