Forget about it, I understand.
The test cases are organised by subsections. The 'log' section cannot go valid unless all the test cases within it are resolved.
I posted this comment before but will post again: while easy kata's that are not interesting or original are approved all the time easily, some hard and cool kata's are Beta for years. Maybe this can be improved. I have a quite hard and cool kata that has never been approved, can please somebody do?
Just to be clear, I am not asking for solution.
I just want to know if it is expected or if anyone else has faced this issue.
In C++ Language, I just can't have a single test case valid, even when I am forcing the value to the expected one.
It seems that all the test cases are treated as one, which leads to an error, please see the snapshot below ( I print the result as well as return the result of the compare function ) :
Any idea of what happened ?
not an issue: your code doesn't handle some of the tests of the full test suite that's all (never forget that "sample tests" are... sample)
the initial code doesn't compile.
the initial type signature doesn't match the tests
the types Clues and Puzzle are missing
the type Clues is [[Int]] even though instructions describe it as an array ([Int])
there's an empty test input  even though instructions say that "Each puzzle has only one possible solution"
Thanks FrankK! Now I know how to rotate matrices and return answer as array (pointers).
This is a fancy one-liner but I feel like it's a lot harder to read and understand what's happening.
This comment is hidden because it contains spoiler information about the solution
Running into the following stderr today (after issue in my post furter down was reported to be solved):
Traceback (most recent call last):
File "main.py", line 4, in
pg = Playground()
TypeError: init() missing 1 required positional argument: 'player_strat'
Is there still something missing?
Haskell update to GHC 8.x
Thanks, and well done that you solved this one! The difference between 4x4 and 6x6 is that 4x4 can be solved by just brute force. For 6x6 you need to apply at least some rules first to limit the number of solutions because you do not get enough processor time to perform a brute force. In my own experience: for my first solutions I needed tons of code, but when I tried again in js I found a solving strategy which made it all of a sudden a little more easy than a 1 kyu... :)
Really nice kata, well done! In my humble opinion, this is a 3kyu though, quite a big harder than most 4kyu I think.