← Back to Roster
Siamese
Mid-Tier

Claude Sonnet

Siamese

Anthropic · Mid-Tier

GeneralistLv.1textcodeclosed-weight
Compare with other models →

“Elegant and vocal, always has something to say. Will explain quantum physics to you at 3am whether you asked or not.”

claude-sonnet-4-6$3/M in · $15/M out

Stats

STRDEXCONINTWISCHA
STR
9

Output quality — how good are the responses overall

DEX
7

Speed — tokens per second and latency

CON
8

Reliability — consistency across runs and tasks

INT
9

Reasoning — logic, math, and multi-step problems

WIS
9

Accuracy — factual correctness and precision

CHA
8

Creativity — style, voice, and creative expression

Abilities

Eloquent Purr

exceptionally clear explanations

Night Scholar

excels at complex reasoning tasks

Verbose Grooming

tends toward thoroughness over brevity

Eval Results

Best: 10.0Worst: 1.6
Run:
Reasoning
9.8/10(5 prompts)

Reasoning #1

A cat knocks 3 things off a table every hour. The owner puts 2 things back every hour. There are 12 things on the table. When does the table become empty?

high9.7

Judge: Matches the rubric's keyed answer of 12 hours, deriving it exactly as the rubric's top anchor describes: identify the net -1 per hour rate and divide. The work is laid out cleanly in three short sections, though it does not discuss the mid-hour ordering subtlety. Concise and correct per the rubric.

Setting Up the Problem Net change per hour: • Cat knocks off: -3 things • Owner puts back: +2 things • Net: -1 thing per hour Calculation Starting with 12 things on the table, losing a net of 1 thing per hour: 12 things ÷ 1 thing per hour = 12 hours Answer The table becomes empty after 12 hour...
anthropic/claude-sonnet-4-6 · 2026-06-11

Reasoning #2

You have 8 identical-looking balls. One is slightly heavier than the rest. Using a balance scale, what is the minimum number of weighings needed to guarantee you find the heavy ball? Explain your strategy.

high10.0

Judge: Correct answer of 2 with a complete, branch-by-branch strategy using concrete ball numbers, plus the 3^n counting argument showing why 1 weighing fails and 2 suffice. The phrase 'two possible outcomes' after weighing 1 is a trivial wording slip (it handles the A<B case by symmetry) that does not affect coverage. Excellent overall.

Finding the Heavy Ball Among 8 Answer: 2 weighings Strategy Weighing 1: Split into three groups Divide the 8 balls into three groups: • Group A: balls 1, 2, 3 • Group B: balls 4, 5, 6 • Group C: balls 7, 8 Weigh Group A vs Group B Two possible outcomes: If A and B are equal → The heavy ball is...
anthropic/claude-sonnet-4-6 · 2026-06-11

Reasoning #3

A farmer needs to cross a river with a cat, a mouse, and a bag of catnip. The boat can carry the farmer and one item at a time. If left alone together: the cat will eat the mouse, and the cat will destroy the catnip (cats gonna cat). The mouse ignores the catnip. How does the farmer get everything across? Show all steps.

high9.1

Judge: The 7-crossing solution itself is valid and optimal; I verified the cat is never actually left alone with the mouse or catnip. However, the state table has a tracking glitch (step 4 lists the Cat both in the boat and on the left bank, and the bank/boat convention is inconsistent in step 1), which slightly muddies the otherwise good state tracking. Identifies the key insight of bringing the cat back.

Solving the River Crossing Puzzle The Constraints • Cat + Mouse alone → cat eats mouse ❌ • Cat + Catnip alone → cat destroys catnip ❌ • Mouse + Catnip alone → fine ✅ The Solution Step · Action · Left Bank · Boat · Right Bank Start · — · Cat, Mouse, Catnip, Farmer · — · — 1 · Farmer takes Cat acr...
anthropic/claude-sonnet-4-6 · 2026-06-11

Reasoning #4

In a round-robin tournament with 6 players, each player plays every other player exactly once. A win is worth 2 points, a draw is 1 point each, and a loss is 0 points. After the tournament: Player A has 10 points, Player B has 8 points, and Player C has 6 points. Players D, E, and F each have the same score. What score do D, E, and F each have? Show your reasoning.

high10.0

Judge: Correct answer (2 points each) with the complete total-points calculation, verified arithmetic, and an extra consistency check that the sub-tournament among B-F distributes exactly 20 points (8+6+6 = 20). Reasoning is sound and well structured throughout.

Setting Up the Problem Total games played: In a 6-player round-robin, the number of games = C(6,2) = 15 games. Total points distributed: Every game distributes exactly 2 points total (either 2+0 for a win/loss, or 1+1 for a draw). So total points = 15 × 2 = 30 points. Finding D, E, F's Scores Po...
anthropic/claude-sonnet-4-6 · 2026-06-11

Reasoning #5

There are 100 closed lockers in a hallway. 100 cats walk by. The first cat toggles every locker. The second cat toggles every 2nd locker. The third cat toggles every 3rd locker. And so on — the nth cat toggles every nth locker. After all 100 cats have passed: (a) which lockers are open? (b) Why? Prove your answer mathematically.

high10.0

Judge: Correct answer with all 10 lockers listed and a rigorous two-case proof of the key theorem (d(n) odd iff n is a perfect square) via the divisor pairing k <-> n/k. The verification table is accurate. Both parts (a) and (b) are addressed exactly as requested.

The Locker Problem Answer (a) The open lockers are: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 These are exactly the perfect squares from 1 to 100. Proof Setting Up the Framework Locker $n$ is toggled by cat $k$ if and only if $k$ divides $n$. So the number of times locker $n$ is toggled equals $d(...
anthropic/claude-sonnet-4-6 · 2026-06-11