Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Created by @Humanosaure,validated by @Timinator,@cedricdd and @Rafarafa.
If you have any issues, feel free to ping them.
Hello,
I’m just wondering how people solved this puzzle. I used genetic algorithm to solve it. In my opinion brute force doesn’t work on this kind of problem. A very simple puzzle to build but to solve…
What language did you use?
I used Python 3, but the only relevant feature of python for this puzzle was the “itertools”. For the rest it is only list…
The genetic algorithme converge quickly : 19 generations for the last test with a gene size of 100 (with mutations, crossover and permutations)
I also used Python. My code is published, so you should be able to see it. I’d be glad to discuss my approach after you have a chance to digest it. I’d also love to take a look at your code, but it does not appear to be published. Would you be willing to publish it? If you’d prefer not to, you could send it to me in a private message.
Hello Timinator. My code now seems to be published. I understood you used a brute force with “escaping”. I thought about doing that but I was afraid to not have a converge within the time left, but I was wrong. So, I tried genetics which are well-known to perform this kind of problem. Such also as the Travelling Salesman, which I try currently.