Probably too boring to publish. This was really just an early test of some general-purpose software I am writing to assist in TAS/RTA routing. For this game it is pretty simple to solve for optimal solutions. First every possible solution (set cover) is found using the dancing links algorithm, then I analyze each cover individually for the fastest overall ordering of piece placements.
I am pretty certain that the level solutions themselves are optimal; the only exception would be if there exists a level where the fastest possible solution involves temporarily picking up a piece, dropping it somewhere & returning for it later, which would be a lot more complicated to search for.
There is also some kind of frame rule weirdness where delaying pressing Start at the end of a level actually saves a frame overall.
I hope I can use this software to improve a less boring game (I am pretty sure it can be adapted to work on the Tetris TAS for example)
feos: Judging...
feos: The movie is good, but there was no definitive feedback, only mixed one, and pure puzzle games like this don't get high entertaining rating often. Acceping to Vault.
Zinfidel: Processing...