Originally this was based on creating an array of these values, and therefore the first value in the array would be at index 0. Index 0 being where n=1 ends up being stored.

You could definitely just rewrite the description / tests so it is directly in regards to the nth value in the sequence.

Infact rereading my description, it really is not very clear.

Cool, I've updated my reference solution now. Passes my tests much faster. My original was definitely very wasteful.

Thanks. Had never though about input mutation before.

As you suggested, I've made it so it calls the reference solution first.

I think I need to check the other reachable positions even after finding a solution for boardSize, incase they lead to a more optimal solution.

I guess what I could do is cut other paths short as soon as they reach the rollNumber of the current most optimal solution.

I'll take a look at your solution, and possibly others, and hopefully learn a trick or two.

Thanks for spotting.

Its fixed now. :P

This is in the rules, but as a sub point, and therefore not super clear. I'll look to make it, its own rule tomorrow.

* Snakes and ladders will always start and end on unique positions.
  * These positions will be greater than 0 and less than boardSize.

Thanks for the feedback.

I have removed that line from the description.

If a roll takes you past the end position, then you do not move.

You are right that this needs clarifying in the description. Thanks for spotting.

I have now added a rule to clarify this behaviour.

I enjoyed the kata. Bit of a shame if it's a duplicate. But the other kata is currently only in Python so maybe you could take what you have done here and turn it into a JS translation of Wordle! Cheat Bot.

Resolved

In JavaScript I was able to get a solution which sometimes passed and sometimes failed the random submission tests.

Kata needs fixed submission tests for numbers like 59995.