That a good algorithm you build for final check. How did you do it?
Also there is a bug where rotating item can push it out of bounce, ang items what holds are not registered in final score.
Viewing post in Blanket Of Shame jam comments
It scans all 232 bed columns and records the highest object pixel in each column.
Between the first and last occupied columns, it calculates:
- Overall height: The blanket’s usual upper height, ignoring a few unusually tall pixels.
- Unevenness by comparing every column with the average height.
- Tilt by comparing the average height of the first 12 columns with the last 12.
- Waves by measuring height changes between every pair of neighboring columns.
These penalties are weighted: height 30%, unevenness 30%, tilt 20%, waves 20%.
Finally, it checks whether every item was placed and subtracts small room-cleanup penalties.
At first it was only checking the start and end points and it was too hard to get a good score so I changed it a lot. Also it still doesn't work very well, but it is enough I think.