Ought to be fixed now

Yes your solution is correct, there seems to be an issue with the code. I'll fix it sometime soon

Alright, thanks!

I know, but I just don't think this issue can be resolved at the moment. I've been trying coutless methods in order to generate the prime numbers without a valid path, however, it either just takes too long or just staight up doesn't work.

Okay it's been 4 hours since I started trying to solve this and I've just noticed what's going wrong. There seems to always be a path, and the ones I manually provided in the tests include a non-prime :| I don't know how to feel about learning that.

If someone can prove me wrong on this, it would be very appreciated.

but @Avanta already told you not to close issues unless they are resolved...

I closed it as I don't think I can fix it, I'll try a few more times, but right now I don't know if I can fix it.

So, this issue is not solved, right...? Why did you close it?

I've been trying to get some code to work, but it just doesn't want to :/
I think it's because there is just a very litte amount of primes that don't have a valid path. Hopefully it shouldn't be a huge problem though. Sorry :/

I see what you mean, I'll try fixing it in a couple of hours, I'm going offline for a bit. It's not a huge issue really, so it should be fine C:

I'll get working on all of this right away, if there's anything more that needs to be fixed, please tell me. I will be going offline for a couple of hours shortly though.

EDIT: Alright, it seems to be fixed now, I added a function and made use of test.pass_ and test.fail, as well as fix the sample tests.

Understood, it should be solved now, if not, please do tell me :D

Oops! I'll go ahead and fix that right away.