cat and mouse graph game theory

Правка en1, от hackerbaba, 2020-06-13 11:28:51

I have just started to solve some game theory problems, and I encountered this, could you please explain as to how in the sample test provided, the result is a draw(0) and not the following?

M: Mouse , C : Cat , -> : goes to node M -> 3 C -> 4 M -> 5 C -> 3 M -> 0

hence mouse wins.?

What did I understand wrong ?

Теги #graph, #graph theory, #game-theory, minmax

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский hackerbaba 2020-06-13 11:30:28 10 Tiny change: 'to node \nM -> 3\n' -> 'to node \n\nM -> 3\n'
en1 Английский hackerbaba 2020-06-13 11:28:51 409 Initial revision (published)