That is, the previous tile played determines the next board into which we must play. When a player plays into $(n_0, m_0)$, his opponent now must play into $(m_0, m_1)$ where $m_1$ is any empty tile inside $m_0$ board. Ultimate tic-tac-toe ( $\text$$ Stand for eight compass directions ("north", "northeast". I'm curious if it is possible to beat it in $17$ or less moves, with either $X$ or $O$? I managed to beat it in $18$ moves with both $X$ and $O$ ( see more details below). You can play against it here, against difficulties ranging from $d=1$ to $d=8$. The "Impossible" references playing against an AI that uses a depth $d=8$ min-max search with a "potential 3-in-a-row" evaluation function ( see more details below.) Is it possible to beat an "Impossible" Ultimate tic-tac-toe in less than $18$ moves?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |