I see what you mean. I will work on better descriptions when I have time later today.

Thank you. I have added assertion messages to all fixed tests. Let me know if they are not detailed enough.

I don't understand what standard is being addressed. Is there a link to best practices that I missed? Thank you.

Thank you. Republished

Changed to margin of error.

Changed to margin of error on perceived time per JohanWiltink's comment

Make sure both tabs are filled correctly: "test cases" (used on "attempt") and "example test cases" (used on "test").

Is there a reason all tests are in assert and the test button is only 1+1==2?

came back and finished. rated "very". thank you for such a fun and interesting kata!

I understand now: "another of the same character picked from the shuffled letters", with all consonants and all vowels repeated at least 9 times in each shuffled pile.

Python, still solving. I dont understand the repetition constraint: "letters can not be used more than once unless there is another of the same character."

This was fun! Wood Tiger

I liked this kata. The sample tests are out of date, however. The 1-based indexing threw me for a while.

I'm not a technical coder, i'm a business coder, with barely passable knowledge of IPs, hex and binary, bitwise operators, etc. I googled my way into understanding and had fun with this one. Very interesting, concise, well packaged, enjoyable. Thank you for the great kata. Not sure why it's still beta.

I'm really enjoying this kata! It's interesting and unique. It has multiple levels of discovery for the uninitiated to a) braille unicode (cool!) b) Hamming distance (also cool!). However, I got bogged sown on the ligatures and text parsing. I think this kata could be split into two. The easy version without ligatures, then a harder version with ligatures. Really love this concept and very fun to grapple with, but will have to come back later to aolve as the ligatures are throwijg me for a loop. Without them i'd have solved already with "very" satisfied rating.