Hello everyone, I ask you if the feasibility conditions of the following system would allow me a development in human time
on a PC 8700k that runs at 5GHz.
I need the following matrix:
44, 11, 9, 11 with the following filters:
Positions:
1 from 1 to 4
2 from 5 to 8
3 from 9 to 12
4 from 13 to 16
5 from 17 to 20
6 from 21 to 24
7 from 25 to 28
8 from 29 to 32
9 from 33 to 36
10 from 37 to 40
11 from 41 to 44
Groups:
1, 5, 9, 13, 17, 21, 25, 29, 33, 37, 41 from 3 to 8
Obviously I do not ask the solution but only if: with the aforementioned PC and the program Anastasios how long I could put
and if I closed to 100% how many wheels I would get about.
Thanks in advance to those who want to answer me.
Giovanni
Feasibility Study
 lottoarchitect
 Site Admin
 Posts: 1465
 Joined: Tue Jan 15, 2008 5:03 pm
 Location: Greece
 Contact:
Re: Feasibility Study
Hi Giovanni, the wheel you seek cannot get constructed in WG, it is too large to deal with. Having said that, you can use this equation to compute the theoretical minimum without any constraints.
http://forums.anastasiostampakis.net/v ... ?f=11&t=35
and it turns out the minimum is in the hundred thousands of blocks. A matrix construction evaluated as FD % (filtered driven) typically requires fewer blocks than the unconditional set  assuming the filters allow for an 100% construction  still it is not really possible, or at least I don't know a way, to estimate the outcome without constructing it first. Perhaps the closest you can use is a proportional evaluation. So, if A=total combinations nCk(44,11) and B=total combinations in A that pass all the filters, C=theoretical minimum of unconditional wheel (the link above), then you can estimate the FD version to need about B/A * C blocks to get constructed. Not sure if anyone else can assist further.
http://forums.anastasiostampakis.net/v ... ?f=11&t=35
and it turns out the minimum is in the hundred thousands of blocks. A matrix construction evaluated as FD % (filtered driven) typically requires fewer blocks than the unconditional set  assuming the filters allow for an 100% construction  still it is not really possible, or at least I don't know a way, to estimate the outcome without constructing it first. Perhaps the closest you can use is a proportional evaluation. So, if A=total combinations nCk(44,11) and B=total combinations in A that pass all the filters, C=theoretical minimum of unconditional wheel (the link above), then you can estimate the FD version to need about B/A * C blocks to get constructed. Not sure if anyone else can assist further.

 Newbie
 Posts: 2
 Joined: Mon Jul 01, 2013 3:19 pm
Re: Feasibility Study
Thanks a lot LA.

 Casual
 Posts: 13
 Joined: Tue Feb 05, 2008 2:40 pm
 Location: USA
 Contact:
Re: Feasibility Study
ilvichingo wrote: ↑Sun Dec 02, 2018 6:30 pmHello everyone, I ask you if the feasibility conditions of the following system would allow me a development in human time
on a PC 8700k that runs at 5GHz.
I need the following matrix:
44, 11, 9, 11 with the following filters:
Positions:
1 from 1 to 4
2 from 5 to 8
3 from 9 to 12
4 from 13 to 16
5 from 17 to 20
6 from 21 to 24
7 from 25 to 28
8 from 29 to 32
9 from 33 to 36
10 from 37 to 40
11 from 41 to 44
Groups:
1, 5, 9, 13, 17, 21, 25, 29, 33, 37, 41 from 3 to 8
Obviously I do not ask the solution but only if: with the aforementioned PC and the program Anastasios how long I could put
and if I closed to 100% how many wheels I would get about.
Thanks in advance to those who want to answer me.
Giovanni
I created a 44, 11, 10, 11 [L=11] covering in 1,048,576 tickets using the positions filters.
Your request can't be done on WG or any commercial program.
Who is online
Users browsing this forum: No registered users and 1 guest