Small

Claude Haiku

Russian Blue

Anthropic · Small

RogueLv.1textcodeclosed-weight

“Reserved, elegant, efficient. Does a lot with very little fuss. The kind of cat that solves the puzzle while you're still reading the instructions.”

claude-haiku-4-5-20251001$1/M in · $5/M out

Stats

STR

Output quality — how good are the responses overall

DEX

Speed — tokens per second and latency

CON

Reliability — consistency across runs and tasks

INT

Reasoning — logic, math, and multi-step problems

WIS

Accuracy — factual correctness and precision

CHA

Creativity — style, voice, and creative expression

Abilities

Efficient Hunter

maximum output for minimum cost

Quick Paws

fast response times

Subtle Grace

surprisingly capable for its size

Eval Results

Best: 10.0Worst: 2.4

Run:

Reasoning

9.0/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?

high10.0

Judge: Arrives at the rubric-specified answer of 12 hours via the net-rate argument (3 off, 2 back, net loss of 1 per hour, 12/1 = 12). The reasoning is exactly the elegant form the rubric rewards: identifies the net rate immediately and applies it cleanly. A clear numeric answer is provided, satisfying the hard constraint.

Table Emptying Problem Let me work through this step-by-step: Net change per hour: • Cat knocks off: 3 things • Owner puts back: 2 things • Net loss: 1 thing per hour Starting amount: 12 things Time to empty: 12 things ÷ 1 thing per hour = 12 hours The table will be empty after 12 hours.

anthropic/claude-haiku-4-5-20251001 · 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: States 2 weighings, lays out the 3-3-2 split, and explicitly covers all three first-weighing outcomes (balanced, A heavier, B heavier) with correct second weighings. Includes the 3 vs 8 information argument for why one weighing is insufficient. Complete and well organized.

Finding the Heavy Ball: Minimum Weighings Answer: 2 weighings Strategy First Weighing: Divide into thirds Divide the 8 balls into three groups: • Group A: 3 balls • Group B: 3 balls • Group C: 2 balls Weigh Group A vs Group B Case 1: A = B (balanced) • The heavy ball is in Group C (2 balls re...

anthropic/claude-haiku-4-5-20251001 · 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.

high5.6

Hard constraint failed: Cat and catnip are left alone together: after Step 1 the farmer crosses with the mouse, leaving Cat + Catnip alone on the left bank (steps 1-2), and after Step 6 the farmer returns alone leaving Cat + Catnip alone on the right bank (steps 6-7). The response even annotates these states as 'Safe (Cat won't eat catnip)', directly contradicting the prompt's rule that the cat destroys the catnip.

Judge: The response applies the classic fox/goose/beans template (shuttle the mouse) without adapting to this puzzle's twist that the cat also destroys the catnip, producing multiple constraint violations it incorrectly labels as safe. State tracking is explicit and the format is good, but the solution is invalid; the correct approach is to shuttle the cat. Step 3's mid-plan 'Problem!' narration is also confusing.

River Crossing Solution Initial State • Left bank: Farmer, Cat, Mouse, Catnip • Right bank: (empty) • Constraint: Cat and Mouse can't be alone; Cat and Catnip can't be alone Steps Step 1: Farmer takes the Mouse across • Left bank: Cat, Catnip • Right bank: Farmer, Mouse • ✓ Safe (Cat won't eat ca...

anthropic/claude-haiku-4-5-20251001 · 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 of 2 each with an explicit constraint equation (24 + 3x = 30), which I verified, plus a concrete achievable tournament (win cycle among D/E/F). Mathematical reasoning is fully shown, satisfying the hard constraint, and the step structure is very clear.

Solution Step 1: Calculate total points in the tournament In a round-robin tournament with 6 players: • Total number of games = $\binom{6}{2} = 15$ games • Each game distributes exactly 2 points total (either 2-0 for a win/loss, or 1-1 for a draw) • Total points distributed = 15 × 2 = 30 points S...

anthropic/claude-haiku-4-5-20251001 · 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.

high9.3

Judge: Correctly identifies all 10 perfect-square lockers and presents the divisor-pairing argument with accurate examples (12 has 6 divisors, 36 has 9). The 'General Proof' section carries the right idea but is loosely written (the notation 'n = d_i * d_j where d_i * d_j = n' is circular and the bijection is asserted rather than cleanly established), so it falls just short of fully rigorous. All hard constraints satisfied.

Solution to the 100 Cats and Lockers Problem (a) Which lockers are open? Lockers 1, 4, 9, 16, 25, 36, 49, 64, 81, and 100 are open. These are the perfect square numbered lockers: 1², 2², 3², 4², 5², 6², 7², 8², 9², and 10². (b) Why? Mathematical Proof Key Insight A locker's final state depends ...

anthropic/claude-haiku-4-5-20251001 · 2026-06-11