C. Teoria jocurilor (2)

Pentru aceeași problemă de mai sus, care este numărul minim de pași prin care poate finaliza jocul jucătorul dacă primește numărul 2019? Dați câte o strategie optimă.

Sursa: problema originala (Zoltan Szabo)

Mai multe informații: J.Chen, D.Vekhter, Game Theory – von Neumann and the Development of Game Theory: https://cs.stanford.edu/people/eroberts/courses/soco/projects/1998-99/game-theory/neumann.html; Filmul The Last Casino: https://www.imdb.com/title/tt0419909/; Filmul 21 https://www.imdb.com/title/tt0478087/?ref_=fn_al_tt_1

 

C. Game Theory (2)

For the above problem, which is the minimum number of steps to end the game if the player gets the number 2019? Give an optimal strategy.

Source: original problem (Zoltan Szabo)

More information: J.Chen, D.Vekhter, Game Theory – von Neumann and the Development of Game Theory: https://cs.stanford.edu/people/eroberts/courses/soco/projects/1998-99/game-theory/neumann.html;  The movie The Last Casino: https://www.imdb.com/title/tt0419909/; The movie 21 https://www.imdb.com/title/tt0478087/?ref_=fn_al_tt_1

 

Logheaza-te in site pentru a trimite solutii si comentarii