nintendo
Jump to date
Friday, February 26, 2021
"The location of the four Munchlax trees is then determined as follows:
A = sid1 % 21
B = sid2 % 21
C = tid1 % 21
D = tid2 % 21
The game checks if any of these are equal. If A is equal to B, B is increased by 1. The game then checks A against C, followed by B against C, adding 1 to C if it is equal after either check. Then the game checks A against D, followed by B against D, and then C against D, and adds 1 to D if it is equal after any of the checks. If at any point any of B, C, or D would equal 21, they are set to 0 instead.
The final values of A, B, C, and D represent the locations of the Munchlax trees. The number can be treated as a 0-based index into the list of Honey Tree locations above. That is, if A = 10, that means the Honey Tree on Route 212 south can contain Munchlax."
