C
Chris Dunaway
I am posting this here because I think someone here will either know
the answer or know a better place for me to ask this question.
I am looking for an algorithm to provide AI for a Tic Tac Toe (aka
Naughts and Crosses) style game. But not necessarily for Tic Tac
Toe.
I'm looking for an algorithm that can evaluate and arbitrary sized
board with an arbitrary win condition. So for example, tic tac toe is
a 3 by 3 board with a win condition of 3 in a row.
I need an algorithm for an m by n board with a win condition of x in a
row where x <= m and x <= n.
Does that make any sense?
I don't just want code (but I'll take anything I can get), I want to
learn the algorithm. This is for my own private project.
Does anyone have such an algorithm or know a good resource where I
could learn about such algorithms?
Thanks,
Chris
the answer or know a better place for me to ask this question.
I am looking for an algorithm to provide AI for a Tic Tac Toe (aka
Naughts and Crosses) style game. But not necessarily for Tic Tac
Toe.
I'm looking for an algorithm that can evaluate and arbitrary sized
board with an arbitrary win condition. So for example, tic tac toe is
a 3 by 3 board with a win condition of 3 in a row.
I need an algorithm for an m by n board with a win condition of x in a
row where x <= m and x <= n.
Does that make any sense?
I don't just want code (but I'll take anything I can get), I want to
learn the algorithm. This is for my own private project.
Does anyone have such an algorithm or know a good resource where I
could learn about such algorithms?
Thanks,
Chris