Databases
StackOverflow2013
Postsdbo
POReturn bestMove in minimax algorithm for tictactoe
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POReturn bestMove in minimax algorithm for tictactoe
    primarykey
    data
    text
    <p>I have tried to code the minimax algorithm for tic-tac-toe given in Russel Norvig's book on Artificial Intelligence. It had everything except that the way to return the bestMove to the user. I am trying hard to return the bestMove, but cannot decide when to choose the bestMove. Help, anyone? </p> <pre><code>moveT MiniMax(stateT state) { moveT bestMove; max_move(state,bestMove); return bestMove; } int max_move(stateT state,int &amp; bestMove) { int v = -10000; if(GameIsOver(state)) { return EvaluateStaticPosition(state); } vector&lt;moveT&gt; moveList; GenerateMoveList(state, moveList); int nMoves = moveList.size(); for(int i = 0 ; i &lt; nMoves ; i++) { moveT move = moveList[i]; MakeMove(state, move); int curValue = min_move(state,bestMove); if(curValue &gt; v) { v = curValue; bestMove = move; } RetractMove(state, move); } return v; } int min_move(stateT state, int &amp;bestMove) { int v = 10000; if(GameIsOver(state)) { return EvaluateStaticPosition(state); } vector&lt;moveT&gt; moveList; GenerateMoveList(state, moveList); int nMoves = moveList.size(); for(int i = 0 ; i &lt; nMoves; i++) { moveT move = moveList[i]; MakeMove(state, move); int curValue = max_move(state,depth+1,bestMove); if(curValue &lt; v) { curValue = v; } RetractMove(state, move); } return v; } </code></pre> <p>P.S.: There are other pseudocode for finding the minmax value. However, they are focused on tic-tac-toe only, I am trying to extend it to other games. Thanks.</p> <p>Update : The whole code can be found here : <a href="http://ideone.com/XPswCl" rel="nofollow">http://ideone.com/XPswCl</a></p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USmotiur
    1. USmotiur
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTDuplicate
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. This table or related slice is empty.
      1. VTApproveEditSuggestion
    2. VO
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. USmotiur
      1. VTBountyStart
    1. COIs the code you posted above up-to-date? Because it doesn't look like it should compile. In `min_move` you call `max_move` with three arguments, but max_move can only take two arguments.
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. USKevin
    2. CO@Kevin: Oops , it is now updated . I tried to limit the depth at some point .
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. USmotiur
    3. COThanks for updating, but the incorrect line is still there: `int curValue = max_move(state,depth+1,bestMove);` This is causing me to worry; it makes me suspect that the code you're posting is not the code you're compiling. That makes it doubly challenging for potential answerers to find the problem. We'll identify bugs in the posted code that aren't there in the real code, and we won't be able to find bugs in the real code if they aren't in the posted code.
      singulars
      1. POReturn bestMove in minimax algorithm for tictactoe
      1. USKevin
 

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