PK
Puzzle PK
Brain Games & Logic Arena
🔐

👀Guest Mode (Unranked)

Guess History0 Guess

🕵️

How to Play

System generated a 3-digit unique code.

A: Number & Position correctB: Only Number correct

Example: Code is 1234

Guess 1543 -> Hint 1A2B

•
P1
•
P2
•
P3
Please enter your guessed 3-digit unique code
📝 Memo Tap: Exclude (crossed) / Include (green)
ALL
1
2
3
4
5
6
7
8
9
0
P1
1
2
3
4
5
6
7
8
9
0
P2
1
2
3
4
5
6
7
8
9
0
P3
1
2
3
4
5
6
7
8
9
0

🎮 How to Play & Controls Guide

About Codebreaker (Bulls and Cows / 1A2B)

Codebreaker is a legendary deduction and cryptanalysis puzzle rooted in the historic 19th-century game Bulls and Cows and the commercial board classic Mastermind. Your objective is to crack a secret unique-digit code generated by the system within a limited number of trials. After each deduction attempt, the engine provides exact feedback in the form of A (Bulls: correct digit and correct position) and B (Cows: correct digit but wrong position). Featuring client-side instant execution, customizable difficulty, and real-time multiplayer speed duels!

Keybindings & Control Guide

Action Keyboard Key Mouse / Touch Description
Input Digit 0 - 9 Tap virtual number pad Fills current empty slot (duplicate digits are prevented)
Backspace Backspace / Delete Tap red erase button Removes the most recent digit entered
Clear All Esc Double tap clear button Resets the entire current input row
Submit Guess Enter Tap glowing Submit button Validates guess and reveals ?A?B feedback instantly
Deduction Scratchpad - Tap scratchpad circles Cycle 3 states: Default Neutral → Strikethrough Cross → Green Confirmed

Core Mechanics: The 1A2B Clue Algebra

Every time you submit a guess, the evaluation engine scores your guess against the secret code with two metrics:

  • A (Bulls / Exact Matches): The digit exists in the secret code AND is in the exact right position.
  • B (Cows / Permutation Matches): The digit exists in the secret code, but is located in a different position.
  • Important: Feedback pegs provide aggregate counts only, never pinpointing which individual slots matched! For example, if the secret is 1234 and you guess 1543, you receive 1A2B (digit 1 is at slot 1 = 1A; digits 3 and 4 exist but are displaced = 2B; digit 5 is completely absent).

Pro Solving Strategies & Information Theory

  1. The Dual-Probing Opener (0123 / 4567): Guessing two completely disjoint sets tests 8 out of the 10 available digits in just 2 turns. Summing the total clues (A+B) reveals whether the remaining unprobed digits (8 and 9) are in the code, collapsing the search space from 5,040 to under 40 candidates!
  2. Zero-Feedback Elimination Jackpot: Receiving 0A0B is the biggest tactical breakthrough in the game. It completely eliminates 4 digits at once. The candidate pool shrinks from 5,040 to P(6,4) = 360, eliminating 92.86% of all possibilities in a single stroke!
  3. Single-Variable Substitution: When testing confirmed digit candidates, alter only one slot at a time. If total clues increase, the new digit is guaranteed present. If total clues decrease, the replaced digit was part of the secret code.

Real-Time Multiplayer Speed PK

  • Identical Secret Code: Both contenders race against the exact same seed, ensuring pure competitive parity.
  • Live Progress Telemetry: Keep an eye on your opponent's attempt count, highest achieved 'A' count, and cadence to pace your analytical moves against intuition.
  • First to 4A0B Wins: Break the code in fewer attempts or faster time to claim victory and leaderboard trophies.

Frequently Asked Questions (FAQ)

Can a guess ever produce 3A1B?

Never! In a 4-digit code, if 3 digits are in their exact correct positions (3A), the remaining 4th digit has only one vacant position. It is either the correct digit (giving 4A0B), or an incorrect digit (giving 3A0B). It can never be displaced in another position, making 3A1B a mathematical impossibility.

Where can I study advanced Knuth Five-Guess algorithms and candidate matrices?

Explore our definitive masterclass guide: 《Codebreaker Deep Strategy Guide & Information Theory Algorithm Book》, featuring Donald Knuth's Minimax tree analysis, 14 feedback partition theorems, and candidate reduction tables!

🎓
Master Class & Tutorials
Want to solve expert puzzles faster? Read the full strategy guide & techniques
📱

Add to Home Screen for Quick Access

Enjoy native fullscreen & offline instant play