Clay Mathematics Institute
Dedicated to increasing and disseminating mathematical knowledge Ian Stewart on Minesweeper It's not often you can win a million dollars by analysing a computer game, but by a curious conjunction of fate, there's a chance that you might. However, you'll only pick up the loot if all the experts are wrong and a problem that they think is extraordinarily hard turns out to be easy. So don't order t
Minesweeper and NP-completeness
Minesweeper is NP-complete! My original paper appeared under this title in the Spring 2000 issue of the Mathematical Intelligencer (volume 22 number 2, pages 9--15). It was discussed by Ian Stewart in the Mathematical Recreations column in the Scientific American, in October 2000, and has been discussed in newspapers in the USA (including the Boston Globe on November 1st, 2000) and on national rad
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
https://web.mat.bham.ac.uk/R.W.Kaye/minesw/minesw.pdf
{{#tags}}- {{label}}
{{/tags}}