GitHub - wonszrzeczny/problem640: incorrect solution to problem 640. Used a heuristic approach, the card with the lowest probability out of the rolled options is turned face down, if there is no such card the card with the highest probability is turned face up. The expected value can be then calculated from the transition matrix of the markov chain. Very surprising this doesn't work! I guess it has to do with the fact some of the options are not independent, and this is where my intuition failed me. Works for n up to n=4

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
.idea		.idea
640.py		640.py

About

incorrect solution to problem 640. Used a heuristic approach, the card with the lowest probability out of the rolled options is turned face down, if there is no such card the card with the highest probability is turned face up. The expected value can be then calculated from the transition matrix of the markov chain. Very surprising this doesn't …