[ X ]
building triple triad card using minimax algorithm
all, can u help me...;p
This forum is locked: you cannot post, reply to, or edit topics.   This topic is locked: you cannot edit posts or make replies. Page 1 of 1
View previous topic :: View next topic  
Author Message
songoku107723
Level: 80


Position: Registered User
Joined: 27 Sep 2008
Posts: 2
Kel: 3  [ Donate ]

Online Status: Offline
PostPosted: Sat Sep 27, 2008 4:11 pm    Post subject: building triple triad card using minimax algorithm Reply with quote

hello, i'm newbie, i want ask how if i want building triple triad card using minimax algorithm, can all of u help me to give some idea? by the way thanks...^^
Back to top
View user's profile Find all posts by songoku107723 Send private message Send e-mail ICQ Number
Sleipnir
Level: 150



Position: Administrator
Joined: 10 Apr 2002
Posts: 4040
Kel: 3549  [ Donate ]

Online Status: Offline
PostPosted: Sun Sep 28, 2008 2:46 am  Reply with quote

Combinatorics isn't really my field, but Wikipedia filled me in on the details... so lets take a stab.

A bit more information would be useful - Are you implementing this in an actual game, or as a theoretical exercise (e.g. a Maths assignment)?
I'm assuming the Minimax you're talking about is the game-theory AI algorithm, so if you're building an actual game there will be a lot of other code to worry about first.

If you restrict yourself to the "Open" rule (where the AI can see the player's cards), and assume infinite computing resources (so that we don't need to worry about recursing over an arbitrarily large tree) then just construct a tree of all possible moves.

Then you can assign the leaf nodes a value of +/- 1 if a player wins/loses normally, 0 if it a draw, and +/- infinity if a player gets a perfect win/loss (entailing the winner to take all 5 of the losers cards).

Then you can just use the algorithm (given on Wikipedia, and i assume a number of other sources) to determine the best move.

Of course, in reality it is much more subtle than this, as the possible move tree will be quite large, you may need to limit the number of moves the AI looks ahead by.

The end-game scoring is also a bit more subtle - rather than assigning +/- 1, you probably want to assign different weights depending on which cards you win/lose.
For example, if using the rule where you keep whatever cards you flipped, you want to minimize the chance of losing your valuable cards while maximizing the chance of taking your opponents valuable cards.

HTH.
Back to top
View user's profile Find all posts by Sleipnir Send private message Send e-mail Visit poster's website ICQ Number
songoku107723
Level: 80


Position: Registered User
Joined: 27 Sep 2008
Posts: 2
Kel: 3  [ Donate ]

Online Status: Offline
PostPosted: Sun Sep 28, 2008 4:44 am  Reply with quote

eemmm, i implementing this for an actual game for my final project at college, i was make the minimax tree, but get some confuse with how the AI can choose the best move for eliminating the player..., i restrict this game with open rule so it wiil be a game with perfect information as u say AI can see the player's cards.

by the way thank's for ur information... hehehe...^^

i wiil try what u say (assign the leaf nodes a value of +/- 1 if a player wins/loses normally, 0 if it a draw, and +/- infinity if a player gets a perfect win/loss (entailing the winner to take all 5 of the losers cards))

or u have some another idea..? hohoho....;p[/img]
Back to top
View user's profile Find all posts by songoku107723 Send private message Send e-mail ICQ Number
Display posts from previous:   
This forum is locked: you cannot post, reply to, or edit topics.   This topic is locked: you cannot edit posts or make replies. Page 1 of 1