Start by choosing the grid size that matches your game. Copy the cells row by row, beginning at the top left. Keep every number in its current position: the same values in a different arrangement can produce a different answer. If you have already made moves, leave the cells you emptied blank. The example prefilled in the editor is a practice board, not a claim about today’s official puzzle.
Select Solve my board to search. A successful result includes the final tile and an ordered move list. Each move names a source and destination; move the source tile onto that destination in the original game. Use Previous and Next to replay the route, or select a move in the list to inspect the position just before that move. Selecting the first move returns the preview to its starting position without changing the cells you entered.
Three small boards to try
These examples use 2 × 2 boards so you can follow every move. They are teaching examples, not daily answers. Select 2 × 2 in the editor and copy a board below. Read the full route only if you want to see the solution.
Example 1: ordinary numbers
Choose a 2 × 2 grid and enter 1, 1 in the top row and 4, 2 in the bottom row. This small board shows why choosing the destination matters: keep the first result next to the existing 2.
1
1
4
2
Practice example · final tile 8Show the complete 3-move route
Move 1: Move the 1 at row 1, column 1 onto the 1 at row 1, column 2 to make 2.
Move 2: Move the 2 at row 1, column 2 onto the 2 at row 2, column 2 to make 4.
Move 3: Move the 4 at row 2, column 1 onto the 4 at row 2, column 2 to make 8.
Example 2: an addition wildcard
Enter 5, +3 in the top row and 16, 8 in the bottom row. Move the 5 onto +3 so the resulting 8 lands above the other 8. The reverse direction would leave a gap between those numbers.
5
+3
16
8
Practice example · final tile 32Show the complete 3-move route
Move 1: Move the 5 at row 1, column 1 onto the +3 at row 1, column 2 to make 8.
Move 2: Move the 8 at row 1, column 2 onto the 8 at row 2, column 2 to make 16.
Move 3: Move the 16 at row 2, column 1 onto the 16 at row 2, column 2 to make 32.
Example 3: a multiplication wildcard
Enter 4, ×2 in the top row and 16, 8 in the bottom row. You can type x2 or ×2. The wildcard doubles 4 to 8; it does not merge like an ordinary number 2.
4
×2
16
8
Practice example · final tile 32Show the complete 3-move route
Move 1: Move the 4 at row 1, column 1 onto the ×2 at row 1, column 2 to make 8.
Move 2: Move the 8 at row 1, column 2 onto the 8 at row 2, column 2 to make 16.
Move 3: Move the 16 at row 2, column 1 onto the 16 at row 2, column 2 to make 32.
How the search works and where it stops
The solver explores legal merges between horizontal or vertical neighbors. Two ordinary cells must have the same number; an addition or multiplication wildcard can combine with an adjacent ordinary number. After a merge, the source becomes empty and the result stays at the destination. There is no sliding, diagonal movement or jumping across holes. Trying both destinations is important because one direction can leave a useful neighbor while the other creates a dead end.
Searching runs in a Web Worker in your browser. Each attempt has a budget of 250,000 explored board states, and the interface stops the worker after eight seconds. The state budget counts positions the search explores, not puzzle moves or a daily usage allowance. A difficult 4 × 4 arrangement can reach the budget before a route is found. A limit or timeout is therefore not proof that the puzzle has no solution.
The calculator uses exact safe integers. If a possible merge goes beyond that numeric precision, it cannot confirm that branch. A precision-limit result is reported separately from an impossible board. You can still enter a later, simpler position if you are confident the moves leading to it were correct. Repeating the same input does not increase the search budget or guarantee a different outcome.
What to check when a board cannot be solved
Compare the entered grid with the original before changing any numbers. Check the size, distinguish an ordinary 3 from +3, and make sure an empty cell has not been replaced by zero. Then look at the message: invalid input needs correction; no solution means the supported search found no complete route from that position; a limit, timeout or precision message means the result is inconclusive.
If the input is correct and you started midway through a game, undo the most recent move in LinkedIn and copy that earlier position. A move can follow the matching rule and still strand a tile. When you want a verified starting-board solution instead, open today’s SumBreak answer or choose the matching date in the answer archive. The rules guide explains destination choice and wildcard examples in more detail.
SumBreak solver FAQ
Which SumBreak board sizes can I solve?
The editor supports square 2 × 2, 3 × 3 and 4 × 4 grids. Select the size before entering cells, because changing it clears the board. Empty cells are supported. Rectangular boards and sizes larger than 4 × 4 are not supported.
What can I type into a cell?
Use a positive whole number, +3 for an addition wildcard, or x2 or ×2 for a multiplication wildcard. Those are examples; other positive wildcard values also work. Leave a used cell blank. Each entered number or wildcard value must be at most 1,048,576; zero, negatives and decimals are not accepted.
Will the SumBreak solver play the game for me?
No. It calculates and displays a sequence for the board you enter. Use Next or the move list to review the route, then make those moves yourself in LinkedIn’s game. The solver cannot see your live board or update your LinkedIn account.
Does no solution mean today’s puzzle is broken?
No. Check your transcription first. If you entered a partly completed board, an earlier legal move may have made that position impossible. Undo it in the original game or enter the original board. Search-limit, timeout and numeric-precision messages are different: they mean the search could not establish a complete answer.
Is the result the only correct answer?
Not necessarily. The solver returns the first complete route it finds, not a unique route or the only valid order. It only reports success after all occupied cells have merged into one number. Different move orders or final cell locations may also solve the same board.
Supports 2 × 2 to 4 × 4 grids. Only horizontal and vertical neighbors can merge. Searches are bounded so complex boards may need a smaller starting position.