Contest data structure (Generation III): Difference between revisions
mNo edit summary |
(jamming link) |
||
(3 intermediate revisions by 2 users not shown) | |||
Line 2: | Line 2: | ||
{{cleanup}} | {{cleanup}} | ||
==Format== | ==Format== | ||
Information about a move's [[Appeal]]/[[ | Information about a move's [[Appeal]]/[[Jamming]] and other Contest-related data in the {{game|Ruby and Sapphire|s}}, {{2v2|FireRed|LeafGreen}}, and {{v|Emerald}} games are stored in a 4-byte data structure. | ||
{| align="center" style="border: 1px solid #88a; background: #f8f8ff; padding: 0.5em;" cellspacing="1" | {| align="center" style="border: 1px solid #88a; background: #f8f8ff; padding: 0.5em;" cellspacing="1" | ||
Line 34: | Line 34: | ||
==Notes== | ==Notes== | ||
Unlike most other structures which use the move's ID as the key for this array, this array of structures uses the move's | Unlike most other structures which use the move's ID as the key for this array, this array of structures uses the move's Contest description ID as its index. | ||
==Fingerprint== | ==Fingerprint== | ||
Since this array uses the move's | Since this array uses the move's Contest description ID as its index, we chose to display the corresponding description after each structure. | ||
<pre> | <pre> | ||
Line 53: | Line 53: | ||
==See also== | ==See also== | ||
* [[Contest move data structure | * [[Contest move data structure (Generation III)]] | ||
{{data structure}}<br> | {{data structure}}<br> | ||
{{Project Games notice|data structure}} | {{Project Games notice|data structure}} |
Latest revision as of 23:19, 24 August 2023
This article does not yet meet the quality standards of Bulbapedia. Please feel free to edit this article to make it conform to Bulbapedia norms and conventions. |
Format
Information about a move's Appeal/Jamming and other Contest-related data in the Pokémon Ruby and Sapphire, FireRed and LeafGreen, and Emerald Version games are stored in a 4-byte data structure.
Contest Data | |
---|---|
Effect | byte |
Appeal | byte |
Jam | byte |
Padding | byte |
- Effect is a broad description of the effects, and takes on the following values.
- 0 - The appeal effect of this move is constant.
- 1 - Prevents the user from being startled.
- 2 - Startles the previous appealer by the jam effect.
- 3 - Startles all previous appealers by the jam effect.
- 4 - Affects appealers other than startling them.
- 5 - Appeal effect may change.
- 6 - The appeal order changes for the next round.
- Appeal indicates how much appeal this move receives, multiplied by 10. A value of 0x14 (decimal 20) therefore indicates 2 appeal points.
- Jam indicates how much jamming this move produces, multiplied by 10. A value of 0x0A (decimal 10) therefore indicates 1 jam point.
- Padding consists of 1 byte and should always be set to 0x00 (aligns the structure on 4-bytes boundaries).
Notes
Unlike most other structures which use the move's ID as the key for this array, this array of structures uses the move's Contest description ID as its index.
Fingerprint
Since this array uses the move's Contest description ID as its index, we chose to display the corresponding description after each structure.
00 28 00 00 // "A highly appealing move!" 00 3c 00 00 // "After this move, the user is more easily startled!" 00 50 00 00 // "Makes a great appeal, but allows no more to the end!" 00 1e 00 00 // "Can be repeatedly used without boring the JUDGE!" 01 14 00 00 // "Can avoid being startled by others once!" 01 0a 00 00 // "Can avoid being startled!" 01 1e 00 00 // "Can avoid being startled by others a little!" 01 1e 00 00 // "After this move, the user is less likely to be startled!" ...
See also
|
This data structure article is part of Project Games, a Bulbapedia project that aims to write comprehensive articles on the Pokémon games. |