SRD Talk:Elephant

Problem

Hit Dice : 	11d8+55 (104 hp)
Abilities : 	Str 30, Dex 10, Con 21, Int 2, Wis 13, Cha 7
Skills : 	Listen +12, Spot +10
Feats : 	Alertness, Endurance, Iron Will, Skill Focus (Listen)

With 11 HD the animal should have 14 skillpoints. Divided between Listen and Spot that's 7 for each. 7(skillpoints)+1(WIS)+2(Alertness)=10 Skill Focus(Listen) should then bring listen up to +13 instead of the listed +12.

The reason is clear : When doing the conversion from 3rd edition to 3.5 they did a sloppy job, copy-pasting the entry without thinking about the fact that Skill Focus went from giving a +2 bonus to a +3 bonus. —The preceding unsigned comment was added by 85.220.124.195 (talk • contribs) . Please sign your posts.

Good catch! Unfortunately the text of the SRD is copyrighted so we will just have to be happy keeping the correction on the talk page. Jazz Man 10:22, 16 March 2011 (MDT)

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.