thanks for your answer, very helpful

This was very confusing for me too. The array it gives you is minemap = [[True, True, True], [False, False, True], [True, True, True]]. Each new minemap item is going across and each new minemap[x] item is going down, if that makes sence. So it would look like this

True(minemap[0][0])--------------------------------------False(minemap[1][0])--------------------------------------True(minemap[2][0])--------------------------------------------------------------------------------
True(minemap[0][1])--------------------------------------False(minemap[1][1])--------------------------------------True(minemap[2][1])--------------------------------------------------------------------------------
True(minemap[0][2])--------------------------------------True(minemap[1][2])--------------------------------------True(minemap[2][2])--------------------------------------------------------------------------------
Just ignore how the minemap looks in the test arrays. Hopefully this helped.

Either the coordinates are totally messed up, or I'm missing a huge point of perspective. (I think it's the former)

In the sample test case, the last 3x3 mine_map is given as follows:

where 0 means empty cell, X means block.

The solution given is Down, Down, Right, Right, Up, Up.

According to me, the solution should be this: Right, Right, Down, Down, Left, Left.

Someone please make me understand how this makes sense.