## On the Subject of Role Reversal

I just so happens that the rules on the module don't change. So here they are.

To make your sequence, convert the seed to base 6, and if there isn't 7 digits, add 0s to the start until there is. Then only consider the first X digits, where X = (Seed % 6) + 2.

#1 = 1st digit in sequence P(x) = position of x

Seed % 6 | Condition | Action | |

0 | C1 | #1 is Odd? | Skip to C3 |

C2 | #1 + 6 and #2 + 6 2 apart? | Submit P(lowest value) | |

C3 | #2 = 2? | Submit P(first 2) | |

C4 | #1 = #2 | Submit 2 | |

C5 | 0 batteries? | Submit 1 | |

C6 | #1 and #2 3 apart? | Submit P(highest value) | |

C7 | #1 > #2 | Submit 2 | |

C8 | Submit position of first odd value | ||

1 | C1 | 1st SN digit odd? | Skip to C3 |

C2 | Only one # = 5? | Submit P(# = 5) | |

C3 | All #s match? | Submit 2 | |

C4 | Role Reversals > 1? | Submit 3 | |

C5 | Any # < 3 comes before any # > 2? | Submit P(last # > 2) | |

C6 | SN contains any letter in "AELORSV"? | Submit 1 | |

C7 | Two #s match? | Submit P(unique #) | |

C8 | Submit 2 | ||

2 | C1 | More than 2 indicators? | Skip to C3 |

C2 | #1 = 0? | Submit P(last 0) | |

C3 | All #s differ? | Submit P(first 1, 4, 5) | |

C4 | Less than 1 minute remaining? | Submit 1 | |

C5 | #s in ascending order? | Submit P(first # > 2 or non-unique #) | |

C6 | 1-4 solved modules? | Submit # of solved modules | |

C7 | #1 < 3 | Submit P(last # < 3) | |

C8 | Submit 2 |