This is a tool-assisted superplay.
Re-records: 0.
This improves on the previous movie (https://youtu.be/w6W-3n7KVEg) by 100 points.
The previous search program only considered one PC per ten-piece sequence (the apparent best according to a heuristic), and so missed some possible solutions. This new search program considers all possible PCs at every step and only prunes a branch if it is clearly worse or equal to another branch.
I only ran the search on the seed used in the original TAS; I have not re-searched then entire seed space. I estimate that it would take approximately 45.5 CPU days to re-search all 65536 seeds (more optimization is needed). Additionally, the program does not consider PCs containing softdrops.
The input file can be found here: https://gist.github.com/MinusKelvin/703e8597a25f09389f8493a89848e69e
The program used to replay this movie can be found here: https://github.com/MinusKelvin/ppt-tas
The search program can be found here: https://github.com/MinusKelvin/ultra-tas
Re-records: 0.
This improves on the previous movie (https://youtu.be/w6W-3n7KVEg) by 100 points.
The previous search program only considered one PC per ten-piece sequence (the apparent best according to a heuristic), and so missed some possible solutions. This new search program considers all possible PCs at every step and only prunes a branch if it is clearly worse or equal to another branch.
I only ran the search on the seed used in the original TAS; I have not re-searched then entire seed space. I estimate that it would take approximately 45.5 CPU days to re-search all 65536 seeds (more optimization is needed). Additionally, the program does not consider PCs containing softdrops.
The input file can be found here: https://gist.github.com/MinusKelvin/703e8597a25f09389f8493a89848e69e
The program used to replay this movie can be found here: https://github.com/MinusKelvin/ppt-tas
The search program can be found here: https://github.com/MinusKelvin/ultra-tas
- Категория
- Головоломка
Комментариев нет.