If either the text:

To do this, the Driver rolls DICEN a number of times in the GNDT, where N is the number of Routes in the Driver’s pool. The Driver continues to roll until every possible value occurs at least once, then rearranges their list of Available Routes according to the first occurrence of each number (e.g. if they roll 3, 4, 2, 2, 3 1, then their third route becomes first, their fourth route becomes second, their second route becomes third, and their first route becomes last).

or

To do this, the Driver rolls DICEN a number of times in the GNDT, where N is the number of Routes in the Driver’s pool. The Driver continues to roll until every possible value except one occurs at least once, then rearranges their list of Available Routes according to the first occurrence of each number (e.g. if they roll 3, 4, 2, 2, 3 1, then their third route becomes first, their fourth route becomes second, their second route becomes third, and their first route becomes last). The route corresponding to the number that did not come up is placed last.

exists in the ruleset, replace it with:

To do this, the Driver rolls DICEN, DICE(N-1), ..., DICE 3, DICE2, where N is the number of Routes in the Driver’s pool. The Driver then rearranges eir Routes according to the numbers rolled such that the new first Route is the one that previously held the position of the number given by the first die roll, the new second Route is the one that previously held the position of the number given by the second die roll (ignoring the already reassigned Route), and so on. The Route that was not referred to by any of the die rolls is placed last in the new order. (E.g., If a player rolls 2, 2, 1, 2. Their new first Route is the old second Route. The new second Route is the old third Route, which is the second, if the previously reassigned Route isn’t counted. The new third is the old first. The new fourth is the old fifth. The old fourth, having never been rolled, is placed last. The new order, then, is 2, 3, 1, 5, 4.)