Hi mozart-users,
I'm developing a tic-tac-toe with a n*n board, i need
to use an alpha beta strategy but i don't know how to
make the search for horizontal, vertical and
diagonal's possible play.
I'm ussing a tuple Board of n*n length, with each
possition in 0#1.
Supouse the current value of Board is (n=3)
[1 0#1 0#1 0#1 0#1 0#1 0#1 0#1 0#1 0#1]
and i need to explore the next possible play (only one
element of Board).
Does anybody have suugesstions?
The other problem is to find all possible plays in a
l*m board. I need to make a search for horizontals,
verticals and diagonals of length n in the board.
I'm very new in constraint programming but not in oz
and i'll apreciate your help.
thanks a lot.
Albert
__________________________________________________
Do You Yahoo!?
Yahoo! - Official partner of 2002 FIFA World Cup
http://fifaworldcup.yahoo.com
-
Please send submissions to users@mozart-oz.org
and administriva mail to users-request@mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.