Databases
StackOverflow2013
Postsdbo
POMiniMax Implementation
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POMiniMax Implementation
    primarykey
    data
    text
    <p>I am trying to write a small AI algorithm in Java implementing the miniMax algorithm.</p> <p>The game upon which this is based is a two-player game where both players make one move per turn, and each board position resulting in each player having a score. The "quality" of a position for player X is evaluated by subtracting the opponent's score from player X's score for that position. Each move is represented by an integer (i.e. Move one is made by inputting 1, move two by inputting 2 etc)</p> <p>I understand that miniMax should be implemented using recursion. At the moment I have:</p> <p>An <code>evaluate()</code> method, which takes as parameters an object representing the board state (Ie "BoardState" object and a boolean called "max" (the signature would be <em>evaluate(BoardState myBoard, boolean max)</em>). </p> <p>max is true when it is player X's turn. Given a board position, it will evaluate all possible moves and return that which is most beneficial for player X. If it is the opponent's turn, max will be false and the method will return the move which is LEAST beneficial for player X (ie: most beneficial for player y)</p> <p>However, I am having difficulties writing the actual <code>miniMax</code> method. My general structure would be something like:</p> <pre><code>public int miniMax(GameState myGameState, int depth) </code></pre> <p>Whereby I submit the initial gameState and the "depth" I want it to look into.</p> <p>I would then be having something like:</p> <pre><code>int finalMove = 0; while(currentDepth &lt; depth) { GameState tmp = myGameState.copy(); int finalMove = evaluate(tmp, true or false); iniMax(tmp.makeMove(finalMove)); } return finalMove; </code></pre> <p>Would this sound like a plausible implementation? Any suggestions? :)</p> <p>Thanks!</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USSaurav Rastogi
    1. USMrD
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. COIn recursion, you write a method that calls itself, but for a smaller problem size. The while loop is not what you're looking for, you want to call `Evaluate` plenty times for decreasing depth.
      singulars
      1. POMiniMax Implementation
      1. USflup
    2. COEhm... I'm not sure I get what you mean :S
      singulars
      1. POMiniMax Implementation
      1. USMrD
    3. COWhen defining Evaluate, you define it in terms of other calls to Evaluate, but with smaller problem size (one less depth). http://stackoverflow.com/questions/717725/understanding-recursion
      singulars
      1. POMiniMax Implementation
      1. USflup
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload