Minimals

• Guide
• Minimals
• Solution finder

Solution finder’s Path Command has an HTML output called path_minimal.html, wherein all possible solutions are sorted by cover then scanned from highest to lowest cover, removing all solutions whose cover has already been covered by previous setups.

Here’s an example diagram of how sfinder minimals work. sfinder finds that solutions A, C, and E are necessary to maximize cover, as they cover new queues that aren’t covered by the ones before them.

Strict minimals are the smallest possible covering set for a given set of solutions. It can be found through a lot of methods, but may become very computationally expensive or tedious.

You can find out how to find strict minimals from this page on strict minimals.

Here’s an example diagram of strict minimals’ output. It’s not illustrative of how it actually finds the set because that’s a tad bit complicated, but it finds that only solutions A and E are necessary to maximize cover, as opposed to sfinder requiring solutions A, C, and E.

If a setup has too many solutions, you may rather opt for Knewjade’s Path-Filter program used to generate very small (potentially not smallest) solution sets. Read up on that in this page on Path-Filter minimals.

Save minimals are strict minimals, but saved pieces are prioritized. That means the program would rather settle for a 3-solution set that saves 100% Save T over a 2-solution set that saves 100% O if you tell it to do so.

You can find out more on how to find save minimals from this page on save minimals.

The program currently being used can prioritize multiple saves. If you ask for save T then minimals, the solution set will maximize save T before finding solutions with the next specified save, and so on.

A special method of generating minimals, where you can get minimal sets for maximizing a setup’s quad clear chance, T-Spin chance, etc. by converting solution finder’s cover output into a path.csv file, allowing sfinder-strict-minimal to work its magic.

Learn more about how to find custom minimals from this page on custom minimals.