45 lines
1.1 KiB
Plaintext
45 lines
1.1 KiB
Plaintext
|
name_of_card
|
||
|
|
Name: Name
|
||
|
|
Description:
|
||
|
|
|
||
|
|
reduction_to_linalg
|
||
|
|
Name: Reduction to linear algebra
|
||
|
|
Description: Can be used on any monster. It is then regarded as a Level 1 Linear algebra problem.
|
||
|
|
|
||
|
|
opposite_ring
|
||
|
|
Name: Change to opposite ring.
|
||
|
|
Description: The battle is moved into the opposite ring. All levels and bonuses are reversed.
|
||
|
|
|
||
|
|
banach_tarski
|
||
|
|
Name: Apply the Banach Tarski paradox
|
||
|
|
Description: Can be used on any monster. The monster is partitioned into infinitely many small pieces, then put together again into two specimen each identical to the original monster.
|
||
|
|
|
||
|
|
nonexistence
|
||
|
|
Name: Proof of nonexistence.
|
||
|
|
Description: You prove that the monsters in this room do not exist, and they promptly vanish in a puff of logic.
|
||
|
|
|
||
|
|
wlog
|
||
|
|
Name: WLOG
|
||
|
|
Description: Removes any restrictions on another card. Can be used exactly once, on one card.
|
||
|
|
|
||
|
|
not_well_defined
|
||
|
|
Name: Not well defined
|
||
|
|
Description: You show that the description of a monster is not well defined. The monster runs away in embarrassment.
|
||
|
|
|
||
|
|
name_of_card
|
||
|
|
Name: Name
|
||
|
|
Description:
|
||
|
|
|
||
|
|
name_of_card
|
||
|
|
Name: Name
|
||
|
|
Description:
|
||
|
|
|
||
|
|
name_of_card
|
||
|
|
Name: Name
|
||
|
|
Description:
|
||
|
|
|
||
|
|
name_of_card
|
||
|
|
Name: Name
|
||
|
|
Description:
|
||
|
|
|