v1.2.0

This release is a feature release that adds several minor features in addition to fixing several minor bugs.

New Features

• Added the ability to nest choices in a route description. (Note that this feature is technically experimental, but appears to be working correctly at this time.)
• Added the option to specify the maximum number of locations where extra steps can be taken. When used properly, this option can drastically reduce the amount of time necessary to calculate a route. However, it does potentially make the resulting route suboptimal.
• Going along with the previous feature, an option has been added to automatically minimize the number of locations where steps are taken (instead of preferring steps as late as possible). This option will maintain optimality, within the constraint provided by the previous feature.
• Added a multithreaded wrapper script to optimize all 256 seeds of a given route. It's tuned for one machine in particular, but should be largely usable on other machines.

Changes

• Several routes have been updated to the most modern version. Special marathon routes have been added for no64. Changes in the routes themselves are beyond the scope of this document.
• Switched to a third-party map implementation (tsl::sparse_map) to reduce memory usage and increase performance.
• The persistent cache now uses LMDB instead of LevelDB as a backend, which has increased performance drastically (though still orders of magnitude slower than memory).

Bug Fixes

• Fixed several minor output bugs, including the display of extra encounters in search areas and an issue with the numbers (time and encounters) relative to an unoptimized route. The routes themselves were not affected, as they were purely output issues.

v1.1.0

This release is a feature release that primarily adds support for additional types of caches to help mitigate high memory usage.

New Features

• Two new types of cache were implemented: a fixed-size cache which stores up to a given number of states and a persistent disk-backed cache.

Bug Fixes

• Lowered the minimum version of CMake based on testing.
• Fixed a bug regarding the step number of encounters (only caused broken text output).

v1.0.0

This is the first official release of Rosa, ultimately descended from Spoony v0.0.8.

Major Changes

• Eliminated the variety of stochastic solvers in favor of a dynamic programming-based optimal solver.
• All variables are now named explicitly by the route definition author, instead of being implicitly numbered by the program.
• Locations, encounter rates, and encounter groups are now standardized based on the map of a segment, instead of being redundantly specified in the route definition.

Known Issues

• The new solver requires a large amount of memory to solve the routes. While it has been optimized extensively, you can still expect to run out of memory if you attempt to optimize too complicated of a route. If generating anything with many variables or with a high number of maximum extra steps, be sure to watch memory usage. I intend to mitigate this in a couple of potential ways in a later version.

v0.0.8

This is the last legacy version of spoony.