The comma operator makes age,handicap a tuple to Python. The parenthesis make it a tuple to everyone else.

hmm okay, I'll wait a bit I guess. :]

It should be rather OK to approve if the feedback from solvers is clear. Satisfaction votes ar unanimous at 100% which is great, but rank votes seem to be not that uniform.

Excluding the author, only 3 different people have completed this kata. Should I wait a little before approving it or...

thank you!

as a person who averages sub-20 on a rubik's cube, this was the most tedious yet rewarding kata that I have successfully completed. I would highly recommend this puzzle, whether you can solve a cube or not to anyone on this platform, as this is absolutely phenomenal.

Thank you, cbg342 for creating this.

- goldenratio161

P.S. for those in here looking for a hint, try searching up different methods, as some might be easier to implement than the others.

And thanks, I approved your fork :)

You still print logs in full tests when the user's answer is correct.

This should be fixed already. I did a republish and then another one shortly after that after I realized this.

Oops, didn't think that, my bad.

@cbg342, just made a fork that fix the decorator thing. :)

Also, you should remove the test.it decorator in random tests because it's verbose.

warning: the assertions should always be done inside such a kind of decorator. So maybe this is not the right move, here (note: I have no clue about how the tests are written, so I'm just pointing at the fact).

Please double-check before closing issues.

• You still print logs in full tests when the user's answer is correct.

• You should use one assertion per batch:

  • All batch tests pass => test.pass_()

  • Encounter the first failed test => test.fail(msg) and return

  Also, you should remove the test.it decorator in random tests because it's verbose.

Thank you, I've added these changes.

Hi,

• Too many logs are being printed. You should only print logs when the user's answer is incorrect.

• There are so many tests that you should run them in batches rather than one at a time to make it easier for the user to find those failed.

I think it should be fine now. Any algorithm that doesn't excessively search for moves should be faster than the process of evaluating the moves.

̶I̶'̶v̶e̶ ̶o̶p̶t̶i̶m̶i̶z̶e̶d̶ ̶i̶t̶ ̶(̶a̶p̶p̶l̶y̶_̶m̶o̶v̶e̶s̶(̶)̶ ̶n̶o̶w̶ ̶m̶u̶t̶a̶t̶e̶s̶ ̶t̶h̶e̶ ̶c̶u̶b̶e̶ ̶i̶n̶ ̶p̶l̶a̶c̶e̶)̶ ̶w̶h̶i̶c̶h̶ ̶a̶l̶l̶o̶w̶s̶ ̶f̶o̶r̶ ̶5̶0̶0̶ ̶r̶a̶n̶d̶o̶m̶ ̶t̶e̶s̶t̶s̶,̶ ̶b̶u̶t̶ ̶n̶o̶t̶ ̶1̶0̶0̶0̶.̶ ̶D̶o̶e̶s̶ ̶t̶h̶i̶s̶ ̶s̶e̶e̶m̶ ̶e̶n̶o̶u̶g̶h̶?̶
̶I̶ ̶c̶a̶n̶ ̶m̶a̶y̶b̶e̶ ̶o̶p̶t̶i̶m̶i̶z̶e̶ ̶i̶t̶ ̶f̶u̶r̶t̶h̶e̶r̶ ̶b̶u̶t̶ ̶w̶o̶u̶l̶d̶ ̶l̶i̶k̶e̶ ̶t̶o̶ ̶k̶n̶o̶w̶ ̶y̶o̶u̶r̶ ̶t̶h̶o̶u̶g̶h̶t̶s̶.̶ update: now 1000 scrambles