In a number-merging slide game each tile may merge only once per move

Slide a row of equal numbers and the result depends entirely on the order you handle them in: do it naively and tiles chain into one giant number, or the wrong pair merges. This entry gives the exact rule for a row, how to score it, and how to tell whether a move changed anything.

Why this works

Merging works on the row as it was when the move began. A tile made in this move is a result, not an input, so you read each tile once from the wall side, and the order of reading decides which pairs form.

When not to use it

If your game lets tiles chain-merge, such as a combo mode where a new tile can merge again, this rule is the wrong one. Then say so in the rules, since players who know the classic version will assume one merge per move.

In the full entry

• What to build, step by step
• Starting values and the reason for each
• 4 common mistakes and the fix
• A diagram of every state
• 41 lines of example code with 5 checks that pass
• How your AI shows you that it works

Say this to your AI

Use the Spielerando entry "In a number-merging slide game each tile may merge only once per move" (read_entry number-merge-slide-once-per-move) in my game. Build it step by step, and show me how you checked that it works.

Or skip this and connect the MCP: your AI then finds all of this by itself.Connect the MCP