Hi Sandro, I've updated this problem to fix some background loading that should make it harder to timeout. Did you want to have another go?

Hi Voile, I've added a random rotation to increase the number of permutations, but its difficult to generate tests on the fly for this. Generating a puzzle that has a guaranteed single solution can take considerably longer than solving the problem, and it could add inconsistent timeouts to the problem.

My Rust solution should work, but adding the appropriately placed newline characters gives this result. This only pops up when the answer is correct - if I add a newline character at the start of the string, the test fails and no error occurs.

memory allocation of 9223372036854775806 bytes failed

Caused by:
process didn't exit successfully: /workspace/target/debug/deps/challenge-07bd72047d917620 --show-output -Z unstable-options --format json (signal: 6, SIGABRT: process abort signal)

https://github.com/MoonPresident/Latin-Square-Generator

Calling "generate_latin_square" will generate a solution, and calling "cull_latin_square" will generate a problem. Passing the solution into "get_tower_clues" will give you the hints that surround the problem.

Incidentally, I have updated the code to go up to 15x15.

Sorry for the late reply. I currently have no plans to publish a python version, but if you have a python version that works, I'd be happy to work with you on the translation. I can provide you with some test cases if you would like.

I have updated the encoding to reduce the nesting by another layer and included much harder problems. Up to 15 x 15 now!

Count of permutations? How do you mean? This is designed to use skyscaper problems with only one solution.

Hey Crastinus. Thank you for the feedback.

You reminded me I had meant to update this task for a while, so I have rewritten the test cases to extend up to 15x15 and to improve the difficulty. Could you have another go and tell me if its a meaningful improvement?

That is good information, I can definitely use that to refine the load time.

As for the difficulty, I know that the previous test cases were comparatively easy, so I tried to turn the difficulty up so that it was closer to the challenge level of the 6 by 6 and 7 by 7 katas. I am still fine tuning the difficulty, and have ideas for how to make the challenges more moderate or more difficult, as well to standardise the average level of challenge. It all depends on the feedback I get.

Hi Sandro, I have changed the problem set. Its more diverse but also potentially more difficult, however it should have removed the particular problems that were causing you difficulty. If you have another go, please let me know how you find it.

Hey guys, I have updated the test data to up the challenge and reduce the load time. Can you guys have another try and see how it feels?

Hi Sandro, I can confirm that these test cases have a single valid solution using my algorithm.

Hi Sandro. The 11 by 11's are fairly computationaly expensive. I am intending to optimise the backend of this puzzle to give the frontend more time to run, if you read down through this post you will see that there are some problems uploading C++ vectors that I need to work out.

My generation algorithm was designed to only output a problem with a single valid solution. I will test those specific examples locally and get back to you.