Jump to content

  • Log In with Google      Sign In   
  • Create Account


#Actualsefiroths

Posted 15 August 2012 - 11:26 AM

Hi, i'm wondering if i can use minmax for this problem or i should try another way:
a player has 4 pawns that can move accordingly with a roll of 4 dice.
a pawn can move a square spending one die, 2 square spending 2 dice and so on.
a dce used for a pawn will be not used by another pawn.
this lead not to a list of moves, but a tree of moves...

i can make a search on the tree to find all possible game status makeing a list to parse on minmax...
or will be more convenient another approach?

thanks

#1sefiroths

Posted 15 August 2012 - 02:14 AM

Hi, i'm wondering if i can use minmax for this problem or i should try another way:
a player has 4 pawns that can move accordingly with a roll of 4 dices.
a pawn can move a square spending one dice, 2 square spending 2 dices and so on.
a dice used for a pawn will be not used by another pawn.
this lead not to a list of moves, but a tree of moves...

i can make a search on the tree to find all possible game status makeing a list to parse on minmax...
or will be more convenient another approach?

thanks

PARTNERS