SRD:Dire Badger

This material is published under the OGL

DIRE BADGER
Size/Type: Medium Animal
Hit Dice: 3d8+15 (28 hp)
Initiative: +3
Speed: 30 ft. (6 squares), burrow 10 ft.
Armor Class: 16 (+3 Dex, +3 natural), touch 13, flat-footed 13
Base Attack/Grapple: +2/+4
Attack: Claw +4 melee (1d4+2)
Full Attack: 2 claws +4 melee (1d4+2) and bite –1 melee (1d6+1)
Space/Reach: 5 ft./5 ft.
Special Attacks: Rage
Special Qualities: Low-light vision, scent
Saves: Fort +7, Ref +6, Will +4
Abilities: Str 14, Dex 17, Con 19, Int 2, Wis 12, Cha 10
Skills: Listen +6, Spot +6
Feats: Alertness, Toughness, TrackB
Environment: Temperate forests
Organization: Solitary or cete (2–5)
Challenge Rating: 2
Treasure: None
Alignment: Always neutral
Advancement: 4–9 HD (Large)
Level Adjustment: —

These vicious creatures tolerate no intrusions. They cannot burrow into solid rock, but can move through just about any material softer than that. A dire badger usually leaves behind a usable tunnel 5 feet in diameter when burrowing unless the material it’s moving through is very loose.

A dire badger is from 5 to 7 feet in length and can weigh up to 500 pounds.

COMBAT

Dire badgers attack with their sharp claws and teeth.

Rage (Ex): A dire badger that takes damage in combat flies into a berserk rage on its next turn, clawing and biting madly until either it or its opponent is dead. It gains +4 Strength, +4 Constitution, and –2 AC. The creature cannot end its rage voluntarily.

SEE WIKIPEDIA ENTRY: Badger


Back to Main Page → 3.5e Open Game Content → System Reference Document → Creatures

Open Game Content (place problems on the discussion page).
This is part of the (3.5e) Revised System Reference Document. It is covered by the Open Game License v1.0a, rather than the GNU Free Documentation License 1.3. To distinguish it, these items will have this notice. If you see any page that contains SRD material and does not show this license statement, please contact an admin so that this license statement can be added. It is our intent to work within this license in good faith.
gollark: Please do not go around *programming* things in *C*.
gollark: Turing completeness technically requires infinite memory, which no actual implementation has, but the language *in theory* can be TC regardless of implementation.
gollark: Turing completeness means it can simulate any Turing machine, or something, and therefore any other TC thing.
gollark: That one command is just "increment the accumulator", and at the end of execution the output is then taken as a number which is converted to *binary* and interpreted however you like. So just unary encoding reworded slightly.
gollark: You can do Turing completeness in one command. Technically.
This article is issued from Dandwiki. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.