Lecture 19 24 Oct 07 Leimelo Theorem = 2 players = perfect iaformation ~ Finite nodes . Cotes o three Sut omes a wat Either 4 can force awialfor 1) or 1 ean force a tie oF 2 can force a loss(ont) Nim unqel > | canfrcea W, equal > 2 can force a L, eg eg Tr > tie eg. Chess Peoof (by induction) on maxiomvm lenyth oF game N ° if Nel w PSsnpese thc genes dg gs We lain theefire it will be teve. Far games of kaye Ns This is a subgame follosing 4 chadsing up aad ir has length 3 This is « subgame following 4 creosiag down and it has length 2. Example N=3 Nate y Induction hypothesis By Induction hypothesis, upper svegeene has asolvtion. , By Induction hypettesis lower sagen hhas a solution Say, (Li) So thaaslate the above game to: ON This has @ solution 5 tis a game of length 2, © Claim: we'ce done with proof (by rndection) I Solvton initial step, theaseme 1, soletion Open Yaleexemple Danger ~ Fndiay ovteoones. that will ewer be reached array of nodes NuM, Leimelo's Then ~> th geme has @ solution | (which could depend on NM) Entrant Formal Stuff Dele A sane of pecfc infiemation is omen which = | at each nede, the player whose fen ibis Fomove + we Knows which nade She is at (and how she got Pere), Ey ut ovr Del “A pure stmtegy for playeré ina game of perher 22 | 3 laformation is a complete plan eof actions | it spoities which action < will take at each Ne = (ne) <—(EE) oF its decision nodes Core 7? whats happening with —_——- _ ths equilitori ue ? eee 234 tise NE_bt rebtson believing an 0 2 Gnu ince Firat] ployer 2sintyies [2] [r] ployer | Strtyies ry uy Cua] | CD] CD] HS ! Da eee) wes (cdd1,¢) (Coal, )| Open Yale ne ners ste Osean ana Sane