Um, I just thought...
rand() uses an extremely reversible algorithm (linear congruential). All your mine-generation algorithms use rand() in some way, including the STL shuffle functions methinks. I *could* reverse the generation and discover your mines, without breaking any of the above rules, no?
Code:#include <stdio.h> void J(char*a){int f,i=0,c='1';for(;a[i]!='0';++i)if(i==81){ puts(a);return;}for(;c<='9';++c){for(f=0;f<9;++f)if(a[i-i%27+i%9 /3*3+f/3*9+f%3]==c||a[i%9+f*9]==c||a[i-i%9+f]==c)goto e;a[i]=c;J(a);a[i] ='0';e:;}}int main(int c,char**v){int t=0;if(c>1){for(;v[1][ t];++t);if(t==81){J(v[1]);return 0;}}puts("sudoku [0-9]{81}");return 1;}
Thats what I though but some other players could also be caling rand which might make it more difficult.
jafet, why are you giving the secret away? Quantum1024, why would they be running at the same time?
There are 10 types of people in this world, those who cringed when reading the beginning of this sentence and those who salivated to how superior they are for understanding something as simple as binary.
They will all be running "at the same time" ...well in the same loop and all 1000 loops are in same program without reseeding. Which means although you might can figure out the first iteration(more on that) it will be increasingly difficult to figure out later iterations.Originally Posted by Rashakil Fol
For you to figure out the first iteration, you'd have to know the seed, which for the actual test I probably would use a high resolution timer (milliseconds), then you'd have to know how my compiler implements rand() and seed(). Then you 'd have to recreate any rand() calls up to the point that I placed/shuffled the bombs which for the first iteration you won't have to take into account any other players calls to rand().
there is one rule that I didn't mention because I am dual hosting this contest here and at cpp-home their contest FAQ states no globals/statics member variables and though I didn't mention it before I will now, because given the slim chance you did figure out the seed you won't be able to pass it to later iterations of your program.
Last edited by Darryl; 04-08-2006 at 03:05 PM.
...and remember how reputable computer scientists said breaking ciphers by timing hardware ticks was a big stupid waste of time?
I'm not saying that it's practical, just theoretically possible.
Last edited by jafet; 04-08-2006 at 04:43 PM.
Code:#include <stdio.h> void J(char*a){int f,i=0,c='1';for(;a[i]!='0';++i)if(i==81){ puts(a);return;}for(;c<='9';++c){for(f=0;f<9;++f)if(a[i-i%27+i%9 /3*3+f/3*9+f%3]==c||a[i%9+f*9]==c||a[i-i%9+f]==c)goto e;a[i]=c;J(a);a[i] ='0';e:;}}int main(int c,char**v){int t=0;if(c>1){for(;v[1][ t];++t);if(t==81){J(v[1]);return 0;}}puts("sudoku [0-9]{81}");return 1;}
I wonder if one can squeeze a singleton past the "no globals/statics" rule.no globals/statics member variables and though I didn't mention it before I will now, because given the slim chance you did figure out the seed you won't be able to pass it to later iterations of your program.
Well, unless we are dealing with smartcards (or *cough* minesweeper games), things like network latency would make it "a big stupid waste of time"....and remember how reputable computer scientists said breaking ciphers by timing hardware ticks was a big stupid waste of time?
Look up a C++ Reference and learn How To Ask Questions The Smart Way
I'm curious to know how you'd implement a singleton without them.
Could I allocate a memory block off the heap and *forget* to return it? And pray hard it doesn't get written over...
Code:#include <stdio.h> void J(char*a){int f,i=0,c='1';for(;a[i]!='0';++i)if(i==81){ puts(a);return;}for(;c<='9';++c){for(f=0;f<9;++f)if(a[i-i%27+i%9 /3*3+f/3*9+f%3]==c||a[i%9+f*9]==c||a[i-i%9+f]==c)goto e;a[i]=c;J(a);a[i] ='0';e:;}}int main(int c,char**v){int t=0;if(c>1){for(;v[1][ t];++t);if(t==81){J(v[1]);return 0;}}puts("sudoku [0-9]{81}");return 1;}
Hmm, I need to check this board more often...
Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling
What ever happened to the spirit of good sportsmanship? I've noticed in every contest I host, someone is looking for loop-holes in the rules.
The bottom line is that this is a contest to create an algorithm to play minesweeper and not a contest of who can get the highest score. Score is just a tool for judging your algorithm. Therefore a highscore in absence of a good algorithm sounds like a non-entry to me.
Ok, ok, don't get stuffy over it, I'm not really gonna send you cheat entries!
Code:#include <stdio.h> void J(char*a){int f,i=0,c='1';for(;a[i]!='0';++i)if(i==81){ puts(a);return;}for(;c<='9';++c){for(f=0;f<9;++f)if(a[i-i%27+i%9 /3*3+f/3*9+f%3]==c||a[i%9+f*9]==c||a[i-i%9+f]==c)goto e;a[i]=c;J(a);a[i] ='0';e:;}}int main(int c,char**v){int t=0;if(c>1){for(;v[1][ t];++t);if(t==81){J(v[1]);return 0;}}puts("sudoku [0-9]{81}");return 1;}
That's the problem, one may have to twist namespaces to say that it isnt really a global.I'm curious to know how you'd implement a singleton without them.
Well, isnt creative thinking an objective of programming challenges?What ever happened to the spirit of good sportsmanship? I've noticed in every contest I host, someone is looking for loop-holes in the rules.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
Does this namespace twisting still use any static members though?
Last edited by Dante Shamest; 04-11-2006 at 02:39 AM.
Using a namespace to try and circumvent the restriction on globals is different from circumventing the restriction on statics. Of course, much much creative thinking is needed is dependent on the restrictionsDoes this namespace twisting still use any static members though?
I suspect one of those singleton implementations designed to be threadsafe could be used, but I havent looked into them too closely.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
Sure, creatively think of a good algorithm :-0That's the problem, one may have to twist namespaces to say that it isnt really a global.
Well, isnt creative thinking an objective of programming challenges?
Look I'm am not trying to sound stuffy, and I have created programs that did figure out rand() in a contests and if you could do the same with mine, I'd certainly be interested (but not as your entry). That said, I think an easier approach would be to search programs heap space for the vector that stores the grid.
