You are not logged in.
Ah, okay. I thought you meant a tag like on SE.
Where did you get this problem?
A hidden tag?
But what is it needed for?
My money is on the one on the right being the gf of two dice being thrown.
That factorization isn't quite correct.
Okay. Does he have to get those in that order?
Okay, then what?
I need to know if it is enough to reach just one of them before finishing or do you need to get each one separately in multiple goes?
Why can you not answer it? I'm asking what the question wants.
Yes, I know that, but do you need to reach any of them just once or do you need to get to each one?
Just to clear it up, you want to reach 10 the first time, then reach 11 the second time, and so on?
Okay. I'll be waiting for it.
Hm, okay. Any new problem?
That would be some mighty casework.
Yep. It's like that because of what hapens when B tells the truth. You go from the first state to the third state and C is speaking.
Sorry, fixed.
Of course. For the big one, the letters stand for prisoners that are still in the game and the asterisks mark the prisoner whose turn it is. B+C stands for any state in which A is no longer in the game and that state is the goal.
For the ssecond one:
ABC - all three are left, A is speaking
AB - A and B left, A is speaking
AC -A and C left, C is speaking
A and B+C the same as in the big one.
Which matrix?
Hm, what are your altitude equation?
Did you get the answer?
The only thing left bugging me is how to bobbym's simulation.
Maybe l, instead of picking them uniformely from the [1,33] interval, we should pick them with some sort of corresponding distribution.
What are you stuck with?
An identity matrix.
Hm, you won't be needing all of it at once.
First, take out the rows and columns that correspond to the absorbing states. I'll call that new matrix Q. You need to calculate