This is a tool-assisted superplay.
This improves on the previous movie ([ Ссылка ]) by 6870 points.

This run was found by my rewrite of the Ultra solver. This new version uses a database built from all possible 4-line perfect clears. Each 10-tetromino sequence has a list of non-dominated perfect clear solutions. The program uses this database to search for the best sequence of 4-line and 2-line perfect clears. The database is 11 GB large. Thanks to the use of the database, the best run for each seed can be found in about 30 seconds per seed.

I've also done some research into expanding the search to include 6-line perfect clears. I'm planning on focusing on TSD-Tetris perfect clears as I think those have high potential. I'll need to increase the memory of my computer though, it's hard to fit stuff in just 8 GB (only half the database needs to be loaded for the search; the other half is used to construct the input file after the perfect clear sequence is found).

Unfortunately, it's not viable to include all 6-line perfect clear solutions in the search - there are way too many. My perfect clear finding strategy works by finding combinations of placements and then figuring out in what order to place the pieces. For 4-line perfect clears, it took about 4 seconds to find all 24.8 million combinations, plus a week and a half to compute the database from that. For 6-line perfect clears, it takes about 2 weeks to find all 2.7 trillion combinations, and assuming it takes as long to process each of them as it did for the 4-line solutions (in reality, it'll take longer), another seven and a half centuries to compute the database. Not feasible.

I plan on making a PPT2 Ultra TAS at some point.

The input file for this movie can be found here: [ Ссылка ]
The program used to replay this movie can be found here: [ Ссылка ]
The search program can be found here: [ Ссылка ]
Join my Discord server: [ Ссылка ]

свернуть