I'm going to want to be able to recognise and merge the likes of: 5 + 7 / 3 / 11 / 7 + 14 / 1 / 9 - $50 ($200 total) 5 + 7 / 3 / 11 / 7 + 14 / 1 / 2 - $50 (ditto)
into 5 + 7 / 3 / 11 / 7 + 14 / 1 / 2 + 9 $50 ($400 total) And so on, 'recursively' so that in a perfect world I'd end up with each leg ( / = one leg / ) of each grouped bet containing multiple runners - thereby increasing the effective compression ratio. Anyway, seems interesting that something so trivial to unpack is so hard to pack. I did have a thought that since I know what the set of all possible bet combinations looks like, it might be possible to start with a notional coverage of every combination and then find some way of marking those covered by each actual single bet and then prune those not marked - but this would depend on a smart way to represent the full way of covering all 7M combinations. Somehow I think going to take more than a big bit vector to do this! --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
