Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>To be honest, when dealing with AI and heuristics, the most simple tasks can become complicated very quickly. The minimax approach is going to give you the best results and it shouldn't be too difficult considering the fact that you are implementing AI. It is an established standard with 2 player turn based gaming logic.</p> <p>Check out this website... it gives some good insight into tic-tac-toe AI and the minimax implementation.</p> <p><a href="http://www.ntu.edu.sg/home/ehchua/programming/java/JavaGame_TicTacToe_AI.html" rel="noreferrer">http://www.ntu.edu.sg/home/ehchua/programming/java/JavaGame_TicTacToe_AI.html</a></p> <p>Edit:</p> <p>Noticing that someone wrote "Brute Force"... this is going to end up being an inefficient way of the implementation of the heuristics involved in minimax. Iteration through every possible move based on the other players last move is just another way to implement a heuristic.. except it seems to be, in my opinion, more work. Minimax implementation will be simple and effective.</p> <p>Edit2:</p> <p>"Simpler implementation" is somewhat relative. Minimax is the standard and as I said in the comment you can manipulate the heuristic to suit the cases you are looking for...</p> <p>I wish I could tell you the simplest way but there are so many variables dependent on the implantation of your game in code.</p> <p>Take the suggestions, look at you game implementation, and then see what suits you best!</p> <p>What is simple to one person might be complicated to another. I'm just trying to give you options and minimax is pretty solid. Maybe try adjusting it to fit your needs.</p> <p>Edit3:</p> <p>Let me know if you need more direction. I'm happy to help.</p>
    singulars
    1. This table or related slice is empty.
    1. POSimple tic-tac-toe AI
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USAnxGotta
    1. USAnxGotta
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POSimple tic-tac-toe AI
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COTo be clear, are you saying that minimax actually ends up being *simpler* than checking all of the cases from the wikipedia entry, or are you saying that it's not much more complicated while also allowing for more efficient and elegant code?
      singulars
      1. PO
      1. USuser1136342
    2. COI'm saying if you want dynamic play, use minimax. In the case of tic-tac-toe using the cases from the wiki you could hard code those options and follow them in a "brute force" way if you want. It would work fine and guarantee winning in certain cases. I was saying if you want a general heuristic to handle cases you could implement the minimax with your specific heuristic. You could include those "definite win" cases in the heuristic to insure they are covered and then fall back on more general selections if needed. I think a hybrid heuristic including both will serve you best.
      singulars
      1. PO
      1. USAnxGotta
    3. COWhat do you mean by "guarantee winning in certain cases". Wouldn't it guarantee winning in all cases?
      singulars
      1. PO
      1. USuser1136342
 

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