WEII DONE!!

okay i didnt know that there can be bigger gaps (>1) between two weathers.

Hey! I always get 8 different paths for the second test case.
[((2, 1), (1, 0), (0, 0), (0, 0)),
((2, 1), (1, 0), (0, 1), (1, 0)),
((2, 1), (1, 1), (1, 0), (0, 0)),
((2, 1), (1, 1), (1, 1), (1, 0)),
((2, 1), (1, 2), (2, 1), (1, 0)),
((2, 2), (2, 1), (1, 0), (0, 0)),
((2, 2), (2, 1), (1, 1), (1, 0)),
((2, 2), (2, 2), (2, 1), (1, 0))]
My solution is 0.0436 and not 0.256. I dont know what is wrong. Can someone pls help?

Nice Kata, thanks

Ok, thank you for clarfication. Approved.

still consistent with the required knowledge.

The reason the Dirichlet distribution is used is to make sure each row in the matrix sum to 1. Is that the case for the Haskell translation (don't speka Haskell unfortunately)? If so it should be no problems.

Thanks! I saw this just now, but I solved it!!!! Feeling super proud of myself!

Haskell translation

Yes, you can click the "Unlock solutions" button.

Is there a way to obtain the solution for this? I can't get it, I've tried multiple times, but nothing sticks. Help me out, someone, please, I need to know how to do this🤧