![]() |
|
|
#1508 | |
|
May 2003
Belgium
27810 Posts |
Quote:
![]() Also, with automated Primenet interaction, it's impossible to force TF to 72, which I'm currently doing for all exponents I received. |
|
|
|
|
|
|
#1509 | |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
Quote:
And a related question, why do you avoid batch files? Something similar to what James Heinrich said -start without cmd in a batch- is what I'm using now. It does all the affinity/priority stuff as before, but now passes Ctl-C to mfaktc. Of course it's your choice, to bat or not to bat. I'm just curious as to why you don't like them. |
|
|
|
|
|
|
#1510 | |
|
Apr 2011
in vivo
3×52 Posts |
Quote:
Yes, if you are going to type it more than a couple of times, script or batch it. I must admit I'm an Algorithm Junky. The beauty of it when you make it work is a joy into itself. The challenge of debug. Oops, sorry. I sound like Monty Python. Anyway, I'd like to know the outcome as well. |
|
|
|
|
|
|
#1511 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
I was trying to see if it was possible in the shortcut, with its greater simplicity (also, while not really relevant here, for the 'average' user, 'batch file' will put them off completely while 'shortcut' is less terrifying). Also, I only have one instance, unlike the vast majority of people here. If I get unlazy I might re-implement it.
|
|
|
|
|
|
#1512 | ||
|
Oct 2011
7×97 Posts |
Quote:
Quote:
2) you're forgetting I am not a major programmer 3) program was running in basic 4) misspoke... program was looking for the MINIMUM number of tickets it would take to get ALL possible 4 number combos; IE: 1,2,3,4,5,6 has 1,2,3,4 1,2,3,5 1,2,3,6 1,2,4,5 1,2,4,6 1,2,5,6 1,3,4,5 1,3,4,6 1,2,5,6 2,3,4,5 2,3,4,6 2,3,5,6 2,4,5,6 3,4,5,6, so that is 1 card. 6 nested for next loops 1 to 46, 2 to 47, 3 to 48, 4 to 49, 5 to 50 and 6 to 51 = 9,474,296,896 iterations of the calculation process. Don't ask me for the program, this was around 20 years ago and I am going from memory with what I have here. If I am remembering correctly, it ran through this more than once, as on the first run through it would only write to the 'array' if there were no duplicate instances; IE: 1,2,3,4-6,x,x+1 to 51 would be bypassed after 1,2,3,4,5,6 was processed, seems like it looked for all 14, then for 10/14, then 6/14 and then just spit out the remaining unchecked 'array' items as it was easier to use human calculations than continue deeper into the computer calculations. Last fiddled with by bcp19 on 2012-01-04 at 03:41 |
||
|
|
|
|
|
#1513 |
|
Dec 2007
Cleves, Germany
2·5·53 Posts |
|
|
|
|
|
|
#1514 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
11100001101012 Posts |
Quote:
So that still leaves me clueless. |
|
|
|
|
|
|
#1515 |
|
Romulan Interpreter
Jun 2011
Thailand
25B716 Posts |
They are much less in this case, and their number is easier to compute, and they are easy to "spread" (how do you call this process in English? is it "spread"? like writing down all permutations of some set, or all coefficients of some polynomial multiplication, or some sum/series formula?) with a simple algorithm if you want them printed. It will take even less time then I said initially.
Hint: you have maximum 249k of them with the trivial cover: each 1234 is covered by a 1234xy with a random x,y. From here you start cutting. As C(6,4)=15, the theoretical minimum is 16660, assuming you can cover it in a disjunctive manner. Can you? Last fiddled with by LaurV on 2012-01-05 at 08:00 |
|
|
|
|
|
#1516 | |
|
Oct 2011
7·97 Posts |
Quote:
EDIT: One of the other things to consider, the 8088 was a 5MHz processor and probably had at most 64MB memory, which means the program had to do it's array through disc access, which would considerable slow the process, in addition to the slowdown already caused by using basic. Last fiddled with by bcp19 on 2012-01-05 at 16:45 |
|
|
|
|
|
|
#1517 | |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
Quote:
|
|
|
|
|
|
|
#1518 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2·3·1,693 Posts |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| mfakto: an OpenCL program for Mersenne prefactoring | Bdot | GPU Computing | 1676 | 2021-06-30 21:23 |
| The P-1 factoring CUDA program | firejuggler | GPU Computing | 753 | 2020-12-12 18:07 |
| gr-mfaktc: a CUDA program for generalized repunits prefactoring | MrRepunit | GPU Computing | 32 | 2020-11-11 19:56 |
| mfaktc 0.21 - CUDA runtime wrong | keisentraut | Software | 2 | 2020-08-18 07:03 |
| World's second-dumbest CUDA program | fivemack | Programming | 112 | 2015-02-12 22:51 |