>Im writing a short film about a person that tries to solve an
>impossible sudoku. This will also mean that computer programs
>cant solve it either or it would take more than 2 weeks to
>find the results. If you can construct me one, that would be
>great. Since this is just a film, it ends with him creating an
>algorithm the crack it. He finds out that the algorithm also
>relates to the understanding how the universe started. If you
>can, state what makes a sudoku impossible, like what are the
>minimum visible numbers needed for one to complete a 3X3
>sudoku by hand or computer. If you think I should add certain
>facts about sudoku please list them since if it sounds good I
>might use it in film. Cheers
>
>Remember a Sudoku doesn't have to be 9x9 numeric.
>
>You could use a 36x36 alphanumeric grid for extra complexity.
>You could even encode a secrete message into the grid.
>It would however still be susceptible to brute force attack.
>
>Pseudo Cool
yes I go with Pseudo Cool here. Just enlarge the gridsize.
We know, the problem is NP-complete so, your hero might find
out that he had finally solved that biggest actual problem of
mathematics and computer science.
I doubt that it relates to the understanding of how the universe
started.
But it's important for encryption e.g., so your hero would be hunted
and sought after by secret services all over the world.
Isn't that good enough for a moviemaker ?
Average movieviewers would be more interested in such "real world"
action anyway, rather than how the universe looked like 13 billion
years ago. Only cosmologists would like to see your movie...
BTW. do you know the Eternity Puzzle ? See
http://www.archduke.demon.co.uk/eternity/That might match the subject of your film even better than a sudoku.
The inventor thought it were impossible to solve and did put a
million pound prize on it but then it was cracked by two British
programmers in joint work. They didn't need to solve P=NP, though ;-)
Guenter.