Sneasel (5e Creature)

This page may resemble content endorsed by, sponsored by, and/or affiliated with the Pokémon franchise, and/or include content directly affiliated with and/or owned by Creatures Inc., Game Freak, and Nintendo. D&D Wiki neither claims nor implies any rights to Pokémon copyrights, trademarks, or logos, nor any owned by Creatures Inc., Game Freak, and Nintendo. This site is for non profit use only. Furthermore, the following content is a derivative work that falls under, and the use of which is protected by, the Fair Use designation of US Copyright and Trademark Law. We ask you to please add the {{needsadmin}} template if there is a violation to this disclaimer within this page.

Sneasel

Small elemental, any alignment


Armor Class 14 (natural armor)
Hit Points 66 (12d6 + 24)
Speed 30 ft.


STR DEX CON INT WIS CHA
10 (+0) 16 (+3) 14 (+2) 11 (+0) 13 (+1) 12 (+1)

Saving Throws Dex +5
Skills Perception +3, Sleight of Hand +5
Damage Immunities cold
Senses passive Perception 13
Languages Auran, understands Common but can't speak.
Challenge 2 (450 XP)


Inner Focus. The sneasel has advantage on saving throws against being charmed or frightened.

Snow Camouflage. The sneasel has advantage on Dexterity (Stealth) checks made to hide in snowy terrain.

ACTIONS

Multiattack. The sneasel makes two attacks, either with its Claws or with its Ice Shard.

Claws. Melee Weapon Attack: +5 to hit, reach 5 ft., one target. Hit: 7 (1d8 + 3) slashing damage.

Ice Shard. Ranged Weapon Attack: +5 to hit, range 20/60 ft., one target. Hit: 6 (1d6 + 3) cold damage.



Back to Main Page 5e Homebrew 5e Creatures

gollark: > I never tried it. It's nice that it has these safety features but I prefer C++ still. > If I want to be sure that my program is free of bugs, I can write a formal specification and do a > correctness proof with the hoare calculus in some theorem proofer (People did that for the seL4 microkernel, which is free from bugs under some assumptions and used in satellites, nuclear power plants and such)Didn't doing that for seL4 require several hundred thousand lines of proof code?
gollark: Most countries have insanely convoluted tax law so I assume it's possible.
gollark: Hmm, so you need to obtain a hypercomputer of some sort to write your tax forms such that they cannot plausibly be checked?
gollark: What if it's somehow really easy to find *a* solution to something, but not specific ones, and hard to check the validity of a specific maybe-solution? Is that possible?
gollark: Er, maybe?
This article is issued from Dandwiki. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.