The aim of all knapsack problems is to pack a container of fixed size with objects also of fixed sizes in the most efficient manner possible. There are multiple variations of this problem, but this version concerns itself only with the size of the objects.
|
| Additional information is available in this [PDF]. There is, however, one important hint in the PDF worth mentioning here: the game uses pointers and arcs to visualize the modular arithmetic. Usually, you start counting at 0 after a pointer has completed a 360° rotation (e.g. on clocks). A full rotation is the equivalent of surpassing the modulus M. By resetting the count to 0, one obtains the integer remainder mod M. |
|
