It is based on the mathematics of the Tower of Hanoi puzzle, using a recursive method to optimize the back-up cycle.
•
One acceptable weight is a constant exponent (possibly the square) of the multiplicative inverse of the duration (possibly expressed in the number of days) between the date of the generation and the generation available before it.
Ponzi scheme | Snowy Mountains Scheme | BBC Radio 3 New Generation Artists scheme | rotation | Magnet URI scheme | backup | State Management Scheme | Imperial Airship Scheme | Earth's rotation | Darien scheme | Backup | A roads in Zone 5 of the Great Britain numbering scheme | Tenants Purchase Scheme | Rotation | Phoenix Islands Settlement Scheme | National Service Scheme | crop rotation | Collective investment scheme | Youth Training Scheme | Wick rotation | Trent Accreditation Scheme | SCM (Scheme implementation) | Rotation (music) | Polynomial-time approximation scheme | National Gardens Scheme | Great Britain road numbering scheme | Goldfields Water Supply Scheme | Crop rotation | Boneh–Franklin scheme | AUSTUDY Scheme |