> The totalizator system allows us to merge or group these four bets as
> follows:
>
> 5 + 7 / 3 / 11 / 7 + 14 / 1 / 9 - $50 ($200 total)
I'm still trying to get my head around what you're trying to do, but
here's some code:
---snip-
data = ["5 / 3 / 11 / 7 / 1 / 9 -
Sorry, I perhaps didn't frame my initial post very well. I hope my
reply to your other post below has answered these questions.
--
http://mail.python.org/mailman/listinfo/python-list
Your explanation is correct. It's important to realise that effectively
the input many thousands of single bets come out of a black box and it
is then necessary for me to merge them into the grouped format to make
things more manageable. Given an arbitrary bucket of single bets, it is
by no means o
It seems straightforward:
1 / X / X ...
and
4 / X / X ...
becomes 1 + 4 / X / X
If there were a 6 / X / X it would become 1 + 4 + 6 / X / X
I think this means that all possible combinations for any particular
amount may be grouped together in a single ticket.
Cheers,
-T
--
http://mail.python
bullockbefriending bard wrote:
> e.g. we might have:
>
> 5 / 3 / 11 / 7 / 1 / 9 - $50 (5 to come 1st or 2nd in Race1, 3 to
> come first or 2nd in Race 2, etc.)
> 7 / 3 / 11 / 7 / 1 / 9 - $50
> 5 / 3 / 11 / 14 / 1 / 9 - $50
> 7 / 3 / 11 / 14 / 1 / 9 - $50
>
> The totalizator system allows us
bullockbefriending bard wrote:
> (I apologise in advance for posting something slightly OT, but plead in
> mitigation that I'm trying to re-write an old, suboptimal VB6 (erk)
> brute-force attack in a shiny, elegant, pythonic manner. I would really
> appreciate some ideas about an appropriate algo
(I apologise in advance for posting something slightly OT, but plead in
mitigation that I'm trying to re-write an old, suboptimal VB6 (erk)
brute-force attack in a shiny, elegant, pythonic manner. I would really
appreciate some ideas about an appropriate algorithmic approach to this
+ pointers to a
