Try 100-codePointAt(0)

The two knights have not collided in your output.

You must use markdown to format logs, just like you would do for code, because consecutive spaces are not printed properly, see there: https://docs.codewars.com/training/troubleshooting/#post-discourse

In the result, substrings (a substring is for example 2:nnnnn or 1:hhh; it contains the prefix)

Because of that ^

For a given nonempty string s find a minimum substring t and the maximum number k, such that the entire string s is equal to t repeated k times.

That would be true if the string was "abcabc".

.

Your function returned 45885/34060, but that fraction can be reduced to 9177/6812 by dividing the numerator and the denomonator by 5. You have to reduce the resulting fraction until it can't be reduced anymore.