Optimal Yatzy : Kan den optimala algoritmen optimeras?

Detta är en Kandidat-uppsats från KTH/Skolan för datavetenskap och kommunikation (CSC)

Författare: Joakim Hedlund; Niklas Qvarforth; [2015]

Nyckelord: ;

Sammanfattning: Yahtzee is a game based on luck. Yet there are algorithms designed to give an optimal result and succeeds in doing so. This report compares the end result of an optimal algorithm to an algorithm that has been modified for the multiplayer scenario. The modified algorithm tries to win over the optimal algorithm through taking greater risks in its decisions when falling behind in points. The results show that it is not favorable to do so. For the chance taking to be favorable one has to be sure that a loss is certain with the current strategy.

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)