Starts with 2 uneqaul positive numbers on the board. 2players move in turn to write on board a positive number equal to the difference of any 2 numbers already written on the board. the new number written on the board should not be repeated. the player who can not write a new number looses the game. can any one help to implement this game? |
+0 forum
1 | ||

Hi guys, I have been working on a sudoku solver, that finds solution by brute forcing during my school days.... But due to the huge number of loops i couldn't do it at then.... SO decided to complete it now.... So here the algorithm: 1. Get the number of fixed values from the user. 2. Populate those values.. 3. Check if the input sudoku is valid. 4. If valid, fill each posistion by checking numbers from 1 to 9, if they are valid at the posistion... 5. Done.... Well! In my sudoku i have only checked for rows and colomns..... … |
+0 forum
5 | ||

I'm looking for how to brute-force the result of something like [ICODE]"Hi".hashCode()[/ICODE]. I have no idea where to start. I looked for the answer for like 5 hours yesterday. It's for reversing Minecraft seeds. (seed-to-text). I tried my own solution. It's too crap to even post. I tried to find a MD5 brute-force cracker on Google, and modify it to use [ICODE]hashCode()[/ICODE]. It went like [ICODE]"a", "b", "c" ... "y", "z", "a"[/ICODE] when it should be like [ICODE]"a", "b", "c" ... "y", "z", "aa", "ab"[/ICODE]. I really need some help. And it has to be recursive. (So it will go … |
+0 forum
11 | ||

How can we find a sub array in a 1-D array? Is there any other method other than brute force method? It is not for maximum sum so we can't use kadane's algorithm. |
+0 forum
8 | ||

Reusable Code Snippet
Quest for most stupid Sudoku solver I had posted here already here to forum a [beautiful code for solving Sudoku puzzles](http://www.daniweb.com/software-development/python/code/294304/eleagant-and-fast-sudoku-with-generator-expressions), so I was in kind of dilemma what to do, as I read the task to do a sudoku solve as one task in Project Euler. To use the code from before and just take the correct corner numbers or really do something from cratch by myself? I decided to do both. So I took the right answer from the super fine solver and entered the forum to see what kind of solutions the early posters had done for the task. I took as bench … |
+0 forum
2 | ||

Hi everybody. I have a question about the best way to retrieve a list of possible source values from the & operator without checking every combination between the range required. The basic problem I face is I have [B](a&b)=c[/B] I know the values of b and c but need to find all possible values of a. Also note the minimum value of a is equal to c and the maximum value of a is ~(b^c) as demonstrated below. So I have already got in two variables the minimum and maximum possible values of a. Now I need to find the … |
+0 forum
1 |

The End.