On the Subject of Mega Man Boss Rush
This one is actually Easy Man!
Calculate the following:
(batteries + ports) * (last digit of S#) + 1.
If needed, keep the result in range 1-8 by subtracting 8.
Press the character in that position, in reading order on the module (ignoring Mega Man in the center).
In the table below, find the sequence of robot-masters, in which the first robot-master matches the robot-master that was pressed first on the module. Press the remaining robot-masters in the order of the sequence.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| Seq. 1 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 2 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 3 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 4 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 5 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 6 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 7 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
| Seq. 8 | ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Sometimes, one of the eight robot-masters will be replaced with an
E-Tank.
In this case, substitute the missing robot-master with the E-Tank in your sequence of presses. If your first press was the E-Tank, you will need to find and follow the sequence where the first robot-master is the robot-master that is missing.









