I have been running solution finder to try to solve a certain field.txt file. It looks like this:
9
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXXX___XXX
XXX____XXX
The program seems to crash after running for some time. However I know for a fact that there are multiple solutions to solve this map with a perfect clear. I have created this map on jstris as well.
https://jstris.jezevec10.com/map/58880
I have a video to prove one solution that works well.
The reason that this is important is because it is an efficient way to lower the stack while doing a mechanical TSD method. It works because this same shape is created automatically. If the stack is a minimum of 9 lines high, it becomes possible to clear it with an entire bag of pieces. Of course this may not always result in a perfect clear of the screen but it will lower the stack by 8 or 9 lines depending on how the stack got started. This makes it an effective method of achieving even higher scores because it means that more T spin doubles can be done after this. It becomes increasingly important to memorize these patterns so that they can be done in ultra mode.
Until I get solution finder to work for me. I will discover these methods manually and create images of how the solutions work. Here is the first.
