3. Computing the stats

The HP/BP/DP formula and tables, and the special move level

日本語 | English | Français | Español | Italiano | 한국어

Special move level: a three-bit table lookup

The three bits read after the character draw (in terms of the original digits, d6 bit1, d8 bit0, d6 bit0) decide the special move level. In practice it is easier to remember it like this:

d6 mod 4d8 evend8 odd
0Lv.3Lv.2
1Lv.1Lv.1
2Lv.2Lv.1
3Lv.4no move

For Lv.4, make d6 a 3 or a 7 and keep d8 even. Conversely an odd d8 carries the risk of no special move at all. This matches exactly what players had already noticed empirically, that "the 6th and 8th digits follow a rule".

HP/BP/DP: adding two tables

Each stat consumes nine bits, split as four plus four plus one: take one value from table T1, one from table T2, add them, and add 500 more if the last bit is 0. That is all. The one wrinkle is that BP and DP are then halved (rounding down). The number shown on screen is ten times the internal value.

HP = T1[4 bits] + T2[4 bits] + (500 if the 1 bit is 0)
BP = ( T1[4 bits] + T2[4 bits] + (500 if the 1 bit is 0) ) / 2
DP = ( T1[4 bits] + T2[4 bits] + (500 if the 1 bit is 0) ) / 2

The tables, in displayed units, indexed by the four-bit value 0–15:

idx0123456789101112131415
T1 (tens of thousands)3000020000700002000050000300003000030000400004000040000060000100008000090000
T2 (thousands)5000600030009000700035008000150040005000100075000200055005000

So the maximum HP is 90000 + 9000 + 500 = 99500. The fact that every observed HP is a multiple of 500, and every BP and DP a multiple of 250, falls straight out of this structure (internal value times ten, with only BP and DP halved).

Which digit drives which stat

Overlaying the scatter table (page 1) onto this read order gives a practical map:

StatT1 index (the main driver)T2 index+500 bonus
HPd11 b0, d5 b0, d9 b1, d9 b0d9 b2, d12 b3, d3 b1, d8 b1d8 b3 = 0
BPd11 b1, d4 b1, d3 b0, d4 b2d10 b3, d3 b3, d4 b3, d7 b3d10 b2 = 0
DPd5 b1, d12 b1, d9 b3, d8 b2d3 b2, d6 b3, d11 b3, d10 b1d5 b3 = 0

One consequence is worth pulling out. Because a digit can only be 0–9 (the bit patterns for 10–15 are unreachable), HP and DP cannot both be maximised: they compete for bits of d9. There is no "max everything" cap to hit. The largest achievable total is 181000 with a Lv.4 move (HP 99500 / BP 48250 / DP 33250). Working that inversion through for every character gives the strongest barcode page.

In short. There is no randomness and no per-character base value. Specific bits of the barcode index two tables, the values are added, and two of the three results are halved. A "strong barcode" is simply a digit string that happens to hold good indices.

→ Try your own barcode in the tool