Eponine (3.5e Creature)

Eponine

	Eponine
Size/Type:	Medium Deathless
Hit Dice:	14d12 (91 hp)
Initiative:	+9
Speed:	30 ft. (6 squares)
Armor Class:	24 (+5 Dex, +9 natural), touch 15, flat-footed 19
Base Attack/Grapple:	+7/+12
Attack:	2 Claws +12 melee (1d6+7 plus paralysis)
Full Attack:	2 Claws +12 melee (1d6+7 plus paralysis) and Slam +12 melee (1d8+7)
Space/Reach:	5 ft./5 ft.
Special Attacks:	Improved grab, paralyzing touch, create spawn
Special Qualities:	Darkvision 60 ft., Deathless Traits
Saves:	Fort +4, Ref +12, Will +9
Abilities:	Str 20, Dex 20, Con —, Int 11, Wis 10, Cha 10
Skills:	Climb +10, Hide +25, Listen +11, Move Silently +25, Spot +15, Swim +10
Feats:	Alertness, Dodge, Improved Initiative, Lightning Reflexes, Mobility
Environment:	Any
Organization:	Solitary, gang (2–4), or mob (2–4 plus 5–10 Husks)
Challenge Rating:	8
Treasure:	None
Alignment:	Usually neutral
Advancement:	15–21 HD (Medium); 22–28 HD (Large)
Level Adjustment:	—

Eponine are rare and designed to attack unnoticed before dishing out heavy punishment. They all have dark skin with a blue tint and prefer attacking with large mobs of husks under them unless they are confident enough that their stealth will be sufficient.

Combat

Improved Grab (Ex): To use this ability, a eponine must hit a creature of its size or smaller with its slam attack. It can then attempt to start a grapple as a free action without provoking an attack of opportunity.

Paralyzing Touch (Su): A eponine lashes out with its claws in combat. An opponent the claw touches must succeed on a DC 17 Fortitude save or become paralyzed for 1d4 minutes. The save DC is Charisma-based.

Create Spawn (Su): Creatures killed by a eponine rise after 1d4 days as husk under the eponine’s control. They do not possess any of the abilities they had in life.

Back to Main Page → 3.5e Homebrew → Campaign Settings → Blades Of Keran Campaign Setting Back to Main Page → 3.5e Homebrew → Creatures → CR 8

gollark: Please also give me write access to the repo.

gollark: Oh, right, array indexing.

gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```

gollark: <@332271551481118732> Expression parsing is done, I think.

gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.

This article is issued from Dandwiki. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.