Tic Tac Toe AI??

[Creatures]

sorry what is LISP?

and i hate to play reversi because i loose all the time =)

Creatures

[quux]

about the oldest programming language still relevant
(List Processing) and was quite of an importance in the early days of AI.

It is however quite cumbersome to deal with as it heavily relies on parens.

Todate, you might of course use PERL as well (for instance).

... if you prgramm REVERSI you will afterwards win as you have to develop a (dynamic) weighting for the fields which helps a lot to win.

Another nice one is the Tower of Hanoi

CC.

EDIT add (History of LISP):

http://www-formal.stanford.edu/jmc/h...lisp/lisp.html

[qball]

Quote:

...but the computer will never loose this way...

Quote:

get really good at ttt. never lose, win OR tie.

[Creatures]

well not with the PC =)
normally i win but now with this (not finished) progrm it looks like that i will lose =)

Creatures

[Fractile81]

Well, as my roommate just pointed out, there IS a way that you could beat the computer, but it would require that the player 1) goes first, and 2) picks two corners which are diagonally across from themselves (computer blocks center). Then, all they do is place in one of the remaining corners. Computer can only block one of the two possible lines. The player then wins .

_O_|_X_|_O_
___|_X_|_ O_
X | | O // Possible winning situiation

You are right that there is a degree of randomness that would be needed, but after the first 3 moves or so, you have to be countering the other persons moves before they'll win. Really, Tic-Tac-Toe does not take luck at all, but it is more a matter of who gets their "trap" setup first.

Just some more to think about .

[Creatures]

yeah this is a good situation! but i found another one

_O_|_X_|_O_ // player left top corner
___|_X_|___ // PC middle
___|___|_O_ // player bottom right corner and hope that the PC wont chose top right corner

Creatures

[Peter M]

Build a tree of all possible moves (there are less than 3^9=19683 possible situations in TTT), then use a so called minmax algorithm to take the branch that is best for him and worst for the opponent.

While you certainly learn something coding it, the result will be boring. TTT games between two players that aren't entirely stupid ALWAYS lead to a tie.

[Creatures]

yep i agree! the tree thing sounds good, but i have to find out how tis works =)

thanks again
Creatures

[qball]

Quote:

there IS a way that you could beat the computer, but it would require that the player 1) goes first, and 2) picks two corners which are diagonally across from themselves (computer blocks center).

guess y'all never played or mastered the game. Going first is an advantage, though small. Regardless of whether I go first or second...

ttt player, NEVER lose, win OR tie.

The above example, not true, in fact bad play. Going first, always choose center...

Why not true:
1|2|3
4|5|6
7|8|9

I go first (as x), select 1.
kompewter takes 5.
I take 9.
we now have:

X|2|3
4|O|6
7|8|X

kompewter takes 2.
I NEED to go 8, else lose!

we now have:

X|O|3
4|O|6
7|X|X

kompewter takes 7, or lose.
we now have:

X|O|3
4|O|6
O|X|X

I NEED to take 3, or lose.

we now have:

X|O|X
4|O|6
O|X|X

Where do you think kompewter goes?

Tie.

Quote:

Build a tree of all possible moves (there are less than 3^9=19683 possible situations in TTT), then use a so called minmax algorithm to take the branch that is best for him and worst for the opponent.

[Creatures]

you're right, now i see my problem!

thanks again!
Creatures