(no subject)
Jun. 6th, 2011 07:02 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
because i'm sick and playing way too much match-3...
in a standard match-3 game where one move is swapping two adjacent tiles, each move must create at least one line of 3 or more tiles of the same color, all such lines are immediately removed and scored, and there are no special moves or tiles: what is the maximum number of tiles that can be removed in the first scoring round, i.e. before the empty space is filled? from this configuration you can get 14 tiles...
........ ...AB... ...AB... .AABABB. ...AB... ...AB... ........
(swap bold tiles) and i don't think you can do better, but maybe i'm missing something.
The number of tiles that can be removed on the second and subsequent scoring rounds is bounded only by the height of the board, because of this pattern:
.|||.. .BAA.. .ABB.. .BAA.. .ABB.. .B . ......
(vertical bars indicate repetition) but it's still interesting to ask what is the largest kingwise connected pattern around the pattern removed in the first round that can be removed in the second round. you might think it's this pattern:
.......... ...AABB... ...AABB... .AA BB. ...AABB... ...AABB... ..........
with 18 tiles to be removed, but there is no way to create this pattern by exchanging two tiles, from a legal game position.
no subject
Date: 2011-06-07 02:25 am (UTC)We got there from here (lower-case removed in the first round) by swapping the central pair:
And you can take out 8 more in the second round by putting matched pairs beyond the ends of the central column as well -- though I'm not sure I'm understanding exactly what you mean by "kingwise-connected":
no subject
Date: 2011-06-07 03:14 am (UTC)"Kingwise connected" is what I thought was the standard term for a pattern of square tiles connected by chess-king moves (i.e. one square orthogonally or diagonally - no hops). Thus your third pattern fits my constraints fine.
no subject
Date: 2011-06-07 03:16 am (UTC)no subject
Date: 2011-06-07 04:03 am (UTC)One plausible revision is that every 3-row that's removed in the second round must contain a square that's one king-move from the squares removed in the first round.
Even then, though, since kings move diagonally, my suggestion earlier is incomplete. Consider this small revision:
The intriguing bit there is that, although the pattern after collapse is king-wise connected (and fits the "every 3-row contains a square..." rule), it's not king-wise connected before the collapse. Although the top island is not actually necessary for any of the other squares; it turns 3-rows into 4-rows.
So, counting the top island, 40 squares.