Spelrum
| Giraffen | 29 |
| Krokodilen | 1 |
| Elefanten | 2 |
| Musen Böjningslistan | 0 |
| Grisen Böjningslistan | 17 |
| Inloggade | 49 |
Mobilspel
| Pågående | 20 220 |
Forumkategorier
| Användare | Inlägg | |
|---|---|---|
| ANDERStG | 2009-05-15 15:25 | |
 | "But once again, there remains that nagging doubt... The more exciting view one might take is that one day, perhaps, it may turn out that an expert Minesweeper player could spot some pattern in the game that would eventually lead to an polynomial-time algorithm for solving it—and hence polynomial-time algorithms for all the NP-complete problems. Such an outcome would result in methods to crack all of the codes used in the internet and computers across the world." Här finns beskrivet hur man bygger logiska kretsar på ett Röj-bräde: for.mat.bham.ac.uk/R...mi nesw.pdf | |
