Generate passwords for Road Rash 1 and 2 games

Recently I saw a post about Road Rash on Habrahabr and I was wondering: "And how is the password system in the other two parts?" I would like to share my observations and results with you in this article.

First Road Rash

Theory

The password consists of 20 positions, each position consists of 5 bits, total 20 * 5 = 100 bits. These bits store these game parameters:

• number of the occupied place (0-15) on five different tracks (0 means that you have not traveled on this route yet).
• number of points (0-10485750)
• amount of money ((-83886070) -83886070)
• current level (1-5)
• motorcycle (1-8)

Now let's see what the raw password consists of:

(U, SN, SN, SN, SN) (U, PC, PC, PC, PC) (U, RF, RF, RF, RF) (U, PD, PD, PD, PD) (U, GV, GV, GV, GV) (H, H, H, H, H) (H, H, H, H, H) (H, H, H, H, H) (H, H , H, H, H) (N, M, M, M, C1) (M, M, M, M, C1) (M, M, M, M, C1) (M, M, M, M, C1 ) (M, M, M, M, C1) (M, M, M, M, C1) (U, U, L, L, L) (U, U, B, B, B) (C2, C2, C2, C2, C2) (C3, C3, C3, C3, C3) (C4, C4, C4, C4, C4)

Designations

U - unused bits.
SN - number of the occupied place in Sierra Nevada (0-15) in the binary number system.
PC - number of the occupied place in the Pacific Coast (0-15) in binary system.
RF - number of the occupied place in Redwood Forest (0-15) in binary system.
PD - the number of occupied places in the Palm Desert (0-15) in the binary system.
GV - number of the occupied place in Grass Valey (0-15) in the binary number system.
H - the number of points (0-10485750) in increments = 10. The number of points is divided by 10 and the resulting number is converted to binary.
N is the bit of negative values.
M is the amount of money ((-83886070) -83886070) in steps of = 10.
In order to create a positive amount of money, you need to divide the amount of money by 10 and convert the resulting number into a binary number system.
In order to create a negative amount of money, you need:

1. Activate a bit of negative values.
2. Subtract the amount of money from the number 83886080 (modulo), divide the resulting balance by 10 and translate the number into binary.

L is the level number (1-5) in the binary number system.
B - motorcycle number (0-7) in binary system.

Motorcycles	room
SHURIKEN 400	0
PANDA 600	1
BANZAI 750	2
KAMIKAZE 750	3
SHURIKEN 1000	4
FERRUCI 850	5
PANDA 750	6
DIABLO 1000	7

C1 = (sum of positions 1 to 17) mod64 (The resulting number is converted to a binary number system and is mirrored).
C2 = (sum of positions 6 to 10) mod32.
C3 = (sum of positions 11 to 15) mod32.
C4 = C2 XOR C3.

Coding

Characters in positions can take the values ​​0-9 and AV. The bits in the positions are encoded in accordance with the fact that 0 = 00000, 1 = 00001, 2 = 00010 ... U = 11110, V = 11111. That is, it is a simple 5 bit encoding.

Second Road Rash

Theory

The password consists of 8 positions, each position consists of 5 bits, total 8 * 5 = 40 bits. These bits store these game parameters:

• trails at this level (0-5)
• amount of money (0-327670)
• current level (1-5)
• motorcycle (1-16)

Now let's see what the raw password consists of:

(?, M, M, M, C1) (M, M, M, M, C1) (M, M, M, M, C1) (M, M, M, M, C1) (U, U, L, L, L) (B, B, B, B, C1) (T, T, T, T, T) (C2, C2, C2, C2, C2)

Designations

? - always equal to zero.
U - unused bits.
M is the amount of money (0-327670) in increments = 10. The amount of money is divided by 10 and the resulting number is converted into a binary system.
L is the level number (1-5) in the binary number system.
B - motorcycle number (0-15) in binary system.

Motorcycles	room
SHURIKEN 400	0
PANDA 500	1
SHURIKEN TT250	2
PANDA 900	3
BANZAI 7.11	4
BANZAI 600 N	5
BANZAI 750 N	6
SHURIKEN 1000 N	7
BANZAI 7.11 N	8
DIABLO 1000 N	9
PANDA 600	10
BANZAI 600	eleven
BANZAI 750	12
SHURIKEN 1000	thirteen
DIABLO 1000	14
WILD THING	fifteen

T - traversed tracks (0-5).
The order of bits from high to low:
4 - is responsible for the passage of the fifth trace.
3 - is responsible for the passage of the fourth route.
2 - is responsible for the passage of the third route.
1 - is responsible for the passage of the second route.
0 - is responsible for the passage of the first track.
C1 = (the sum of positions 1 to 6, not counting the 5th position) mod32 (The resulting number is converted to a binary number system and is mirrored).
C2 = ((sum of positions 1 to 6) mod32) XOR 7 position.

Coding

The encoding of the values ​​is the same as in the first part.



But that is not all!
I have prepared something else ...

For dessert - Banana Prince

Let's digress a bit from the Sega console and move on to Nes (Dandy). This game very badly ruined my nerves. Who played, he remembers the long questions in Japanese, because of which the passage of the game turns into hell. The passwords in it are simple, but with a subtle emphasis. To complete the game 100% it was necessary to collect 4 armor. But there is one problem, in order to get them, it was necessary to answer a ton of questions. No matter how I delved into the Internet and in my code book, I never found the passwords that save the collected armor. And without them, the final boss will send you far away a ton of Japanese characters. But delving into the assignments of the bits, I found that the game saves:

• current level number (0-20) in decimal system
• weapon number (0-15)
• armor (0-4)

The password consists of 8 positions, each position consists of 2 bits, total 8 * 2 = 16 bits.

Now let's see what the raw password consists of:

(C, C) (A, L) (L, L) (L, L) (C, C) (G, G) (A, A) (G, G)

Designations

C = (the sum of all positions except 1 and 5) in the binary system. The two most significant bits of the checksum are written to the 5th position, and the two least significant bits to the 1 position.
A is the number of armor (0-4) in the binary number system.
L is the level number (0-20) in the binary number system.

Levels	room
1-1	0
1-2	1
1-3	2
2-1	3
2-2	4
2-3	5
3-1	6
3-2	7
3-3	8
4-1	9
4-2	10
4-3	eleven
5-1	12
5-2	thirteen
5-3	14
6-1	fifteen
6-2	16
6-3	17
7-1	18
7-2	19
7-3	20

G - weapon number (0-15) in the binary system.

Coding

For coding, 4 degrees of eating a banana are used, which we denote by numbers:
= 0 = 1 = 2 = 3

Заключение

So we went to the finish line.


What would I like to say? Well, I hope this article is useful to someone. Good luck, thanks for reading.