Pushing Blocks by Sweeping Lines
Hugo A. Akitaya, Maarten L\"offler, Giovanni Viglietta

TL;DR
This paper explores the capabilities and limitations of reconfiguring tokens on a grid using line pushes, revealing which shapes are achievable from certain initial configurations and characterizing rearrangements of labeled tokens.
Contribution
It introduces new results on the reconfigurability of sparse and compact token configurations using line pushes, including characterizations of obtainable shapes and permutations.
Findings
Sparse initial configurations can form any rectangular shape with area n.
Only certain shapes like 1×k, 2×k, and 3×3 are universally obtainable from any sparse configuration.
Complete characterization of reachable configurations from compact initial arrangements.
Abstract
We investigate the reconfiguration of blocks, or "tokens", in the square grid using "line pushes". A line push is performed from one of the four cardinal directions and pushes all tokens that are maximum in that direction to the opposite direction. Tokens that are in the way of other tokens are displaced in the same direction, as well. Similar models of manipulating objects using uniform external forces match the mechanics of existing games and puzzles, such as Mega Maze, 2048 and Labyrinth, and have also been investigated in the context of self-assembly, programmable matter and robotic motion planning. The problem of obtaining a given shape from a starting configuration is know to be NP-complete. We show that, for every , there are "sparse" initial configurations of tokens (i.e., where no two tokens are in the same row or column) that can be rearranged into any $a\times…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
