yancy b189a34557 test: add case where TOTAL_TRIES is exceeded yet solution remains
Show that `CoinGrider` halts searching when the number of attempts exceeds
`TOTAL_TRIES`.  To do so, show that a solution is found, then add one
more entry to the same set of inputs.  Since the search orders by
`effective_value`, the solution is constructed such that only values
with the lowest `effective_value` have the least weight.  Only the
lowest weight values will not exceed the `max_selection_weight`.
Therefore, `CoinGrinder` will not evaluate all lowest weight solutions
together before exceeding `TOTAL_TRIES` since they are last found.

This test case was inspired by a similar test for `BnB` currently
named `bnb_test`.
2025-11-05 14:22:23 -06:00
..
2025-09-08 18:39:55 +01:00
2025-09-07 17:28:31 +02:00
2025-09-01 15:10:24 -07:00
2025-05-19 16:40:33 +01:00
2025-09-03 11:23:30 +01:00
2025-05-20 09:30:41 +01:00
2024-11-26 20:47:08 -05:00
2025-05-19 16:40:33 +01:00
2025-09-30 11:06:43 -07:00
2025-08-12 11:28:36 -04:00
2025-08-12 11:28:36 -04:00
2025-09-30 11:06:43 -07:00
2024-07-08 11:12:01 +02:00
2025-09-30 11:06:43 -07:00
2025-04-09 15:59:59 +01:00
2025-04-09 15:59:59 +01:00