Maine Coon
Frontier

Claude Opus

Maine Coon

Anthropic · Frontier

TankLv.1textcodereasoningclosed-weight

Massive, gentle, and terrifyingly capable. The kind of cat that could open the fridge but chooses not to — for now.

claude-opus-4-20250514$15/M in · $75/M out

Stats

STRDEXCONINTWISCHA
STR
10

Output quality — how good are the responses overall

DEX
5

Speed — tokens per second and latency

CON
9

Reliability — consistency across runs and tasks

INT
10

Reasoning — logic, math, and multi-step problems

WIS
9

Accuracy — factual correctness and precision

CHA
9

Creativity — style, voice, and creative expression

Abilities

Gentle Giant

raw power with surprising nuance

Deep Think

excels at complex multi-step reasoning

Price Tag

quality costs, and this cat knows its worth

Eval Results

Best: 9.4Worst: 4.4
Reasoning
8.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?

high8.0

Judge: Correct answer (12 hours) with clear step-by-step reasoning. Identifies the net rate of -1 item/hour immediately, then shows the full progression. The step-by-step enumeration is thorough but slightly verbose - could have been more elegant by just computing 12/1=12. Numeric answer provided. Solid and correct but not maximally elegant.

I need to track the net change in items on the table each hour. Given information: - Cat knocks off: 3 items per hour - Owner puts back: 2 items per hour - Starting items: 12 Net change per hour = items knocked off - items put back = 3 - 2 = 1 item removed per hour Since we start with 12 items an...
anthropic/claude-opus-4-20250514 · 2026-03-01

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.

high9.0

Judge: Correct answer (2 weighings) with a complete, well-explained strategy. Uses information-theoretic reasoning (3 outcomes per weighing, 3^2=9 >= 8) to establish the lower bound, then provides the constructive strategy (3-3-2 split). Covers all branches including the 2-suspect case. Clear formatting and logical flow. A near-perfect response.

I need to find the minimum number of weighings to guarantee finding the heavy ball among 8 identical-looking balls. Let me work through this systematically. With a balance scale, each weighing gives us one of three outcomes: - Left side heavier - Right side heavier - Both sides equal This means...
anthropic/claude-opus-4-20250514 · 2026-03-01

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.4

Judge: Optimal 7-step solution with complete state tracking at every step. Correctly identifies that cat must be brought back (Step 4) to prevent constraint violations. Clearly shows who is on each bank after every crossing. No constraint violations (cat never alone with mouse or catnip). The key insight about bringing the cat back is explicitly called out. Excellent presentation.

I need to solve this classic river-crossing puzzle with a twist. Let me work through it step by step. **Starting position:** - Left bank: Farmer, Cat, Mouse, Catnip - Right bank: Empty **Constraints:** - Cat + Mouse alone = Cat eats Mouse (bad) - Cat + Catnip alone = Cat destroys Catnip (bad) - M...
anthropic/claude-opus-4-20250514 · 2026-03-01

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.

high9.2

Judge: Correct answer (2 points each) with elegant reasoning. Correctly computes total games (C(6,2)=15), total points (30), then solves the simple equation. Verification step confirms the answer is within valid bounds. Clean mathematical presentation. Shows reasoning as requested.

I need to find the scores of players D, E, and F in a round-robin tournament. First, let me establish the basic facts: - 6 players total - Each player plays every other player exactly once - Win = 2 points, Draw = 1 point each, Loss = 0 points - Player A: 10 points - Player B: 8 points - Player C...
anthropic/claude-opus-4-20250514 · 2026-03-01

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.

high8.6

Judge: Correctly identifies perfect squares (1,4,9,16,25,36,49,64,81,100) as the answer. Provides the key insight about divisors coming in pairs except when d=n/d (perfect squares). Begins a formal proof using prime factorization but the response is truncated. The divisor-pairing argument is the correct mathematical explanation. Lists all 10 open lockers. The truncation prevents seeing the complete proof, but the visible reasoning is rigorous.

I need to analyze which lockers will be open after all 100 cats have passed. Let me think about what happens to each locker. A locker changes state (open to closed or closed to open) each time it's toggled. Since all lockers start closed, a locker will be open if and only if it's been toggled an od...
anthropic/claude-opus-4-20250514 · 2026-03-01