RJOh,
01-01-28-28-27 | 01
03-03-30-30-29 | 03
05-05-32-32-31 | 05
07-07-34-34-33 | 07
09-09-36-36-35 | 09
11-11-38-38-37 | 11
13-13-40-40-39 | 13
15-15-42-42-41 | 15
17-17-44-44-43 | 17
19-19-46-46-45 | 19
21-21-48-48-47 | 21
23-23-50-50-49 | 23
25-25-52-52-51 | 25
>Do the numbers change their position outside the matrix?
No, You were correct in the assumption that 51 is the highest digit that can appear in the last position (5). In position 3 and 4 the 52 would be eliminated.
I know it would have been less confusing to just leave out the 52 etc. from those columns. I left them in for continuity.
The first/lowest set that would appear in this wheeling system would be:
01-03-28-30-31 | 01
The last/highest possible combination in this wheel would be:
23-25-48-50-51 | 25
It may get confusing to wheel these columns. I admit that I didn't try wheeling them by hand, simply because I don't know how many, possibly thousands, I'll end up with.
This is just one strategy that I'm trying to workout. With hundreds of thousands of possible combinations it would be impossible for a software, or algorithm, to predict an accurate and/or reasonable number to play for the independent player. The good news is that by using various scientific methods I can create a balanced matrix that will at least get you into the correct ballpark.
I am getting a copy of Visual Basic tommorrow. I'll give it a go to create a simple utility to do these calculations for me. Code has probably changed since the days of QBASIC or BASICA. I don't intend to bother my programmers with this outside project right now. I need to know if I'm on the right track first or just a dead end.
Hope this helps,
............/George