SRD:Movement Speed

This material is published under the OGL

Speed

Your speed tells you how far you can move in a round and still do something, such as attack or cast a spell. Your speed depends mostly on your race and what armor you’re wearing.

Dwarves, gnomes, and halflings have a speed of 20 feet (4 squares), or 15 feet (3 squares) when wearing medium or heavy armor (except for dwarves, who move 20 feet in any armor).

Humans, elves, half-elves, and half-orcs have a speed of 30 feet (6 squares), or 20 feet (4 squares) in medium or heavy armor.

If you use two move actions in a round (sometimes called a “double move” action), you can move up to double your speed. If you spend the entire round to run all out, you can move up to quadruple your speed (or triple if you are in heavy armor).

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

**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: HAS YOUR NOSE EXPLODED?

gollark: ```haskellimport Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '```

gollark: import Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '

gollark: 3.1 Using 2x2 matricesThe argument of iterateabove is a linear transformation, so we can represent it as matrix and compute the nth power of this matrix with O(log n) multiplications and additions.For example, using the simple matrix implementation in Prelude extensions,fib n = head (apply (Matrix [[0,1], [1,1]] ^ n) [0,1])

gollark: 0, 1, 1, 2, 3...

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