GitHub - HITESHGOEL08/Master: We have used Markov Chain to analyze the Snake and Ladders board game. Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Coming to snake and ladders, in it going to any number’s square on the board depends upon the previous state. Hence, there is a relation between the two. Markov chain can be used to find probability of finishing the snake and ladders game in ‘n’ number of turns. We can even plot a graph for that. The results of Markov chain are very useful in many diverse fields.

HITESHGOEL08 / Master Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

We have used Markov Chain to analyze the Snake and Ladders board game. Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Coming to snake and ladders, in it going to any number’s square on the board depends upon the previous …

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitignore		.gitignore
Code2_Assignment4_SECTIONB (1).xlsx		Code2_Assignment4_SECTIONB (1).xlsx
snake and ladder.png		snake and ladder.png