16
mquintus
1 7 24
837/ 1445
Marius Stübs
Last seen 10 years ago
Member for 11 years, 2 months, 23 days
Difficulty Normal
Best reviews / Newest reviews
First-bryukh 2 1
I didn't know "hypot()" yet, nice one! Shouldn't you have used good_cells as a global variable? The task description encouraged me to do so. This approach seems to come naturally. Did it the same way. I used set.pop() for the randomness ;-) More
threeliner-macobo 1
Nice one! Much better than the usual solution where you redefine the __eq__ operator. More
First-igorcamp 1
Nice and simple. :) Note that you can use // (double slash) if you want to get an integer. More
Math. It is your friend and mine.-Albin
Nice solution, good documentation. I like the simple formula for the partial tiles. More
First-datruth29 1
return True or False This line #11 is never eval()'ed More
Second-mquintus
There I fixed it. But arrrrgh! Why is my "first" solution written underneath this current one? How can I remove that piece? More
First-Avaris
Nice work. Some inline comments would have been great. It took me a while to understand how the "blocks" mechanism works. More
First-Bilou06
Nice and short. This approach seems to come naturally. Did it the same way. I used set.pop() for the randomness, though ;-) More
Worst-jlmink
At least you don't iterate over the same string 4 times, like other solutions. Not the worst!^^ More
First-hitrends
route += direction I like your solution: Nice, short, simple. I used the same method, marking places where I've already been with a number different from 0 and 1. Have you thought of using recursion instead of a while loop? BTW: Some comments would have been nice^^ Great job! More
First-aedd
direction = (direction + 1) % 4 Nice solution, clean an simple. You implemented the "always take the right turn" labyrinth solver. Next time, before you submit the solution, you might wanna take some care about the comments, like removing old stuff and writing your own comments. ;) More