In Python everything seems to be +1-3 kyu easier, while half as fast.

the real Clever is removing the const keyword from the arguments

I assumed the solution page is only visible if you solved the kata?

Hmm, assumed there would be another property besides gcd.

Would be cool if they put execution times next to each solution on this website.

Idk if it is runtime efficient to transpose + reverse the remaining matrix every loop. But people prefer short code to efficiency.

since transitions is constant should have labeled it in captials for BP

forgot to remove 2nd + 3rd line

Dont worry about it. Being stuck seemingly indefinitely happens. When I am stuck like that, I usually pull myself down as well, even tough I know that my best course of action should be getting the problem out of my mind for now, do some other katas or do something entirely else until my mind has relaxed again.

A tense mind limits your creativity extremely, which makes one only more tense. Its a vicioius cycle.

I dont understand why this works. Can someone refer me to a source that make the idea behind this clearer?

I just calculated the points in a space limited by four equations, which seems to be the brute force approach.

Just a dirty A*. Should have used a bin tree for my current nodes.

Thank you for answering me. I will try to implement it, but I haven't programmed in a while, so it will take some time and head bumping on how I get it into the machine.