On Oct 3, 4:49 am, eSKay <catchyouraak...@gmail.com> wrote:
> okay...
>
> perhaps
> "It's a 2-player game that's deterministic, zero-sum, perfect
> information, finite, and without ties. So a winning strategy exists
> for one of the players."
> should have been mentioned... I didn't know that.
>
> Btw, what is the proof of the statement I just quoted?
Most of the descriptions are pretty obvious, the winning
strategy part is an induction proof. If you draw out the
tree and start at the final positions, then each node going
up the tree can be labeled as a win for player 1 or 2, when
it's player one's turn he will, if possible, pick a path that
forces a win for him, likewise with player 2. Minmax uses
the same idea.
Lots of stuff online on game theory, also check out
'Winning Ways' by Berlekamp,Conway,and Guy
--
Geoff
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
