- 1
A minesweeper is a special navy ship. Its job is to find bombs sitting in the water — those bombs are called mines — and make them safe, so other ships can pass. In war, people hide mines in the sea to break hulls; a minesweeper goes first and slowly “sweeps” a path, as if it were brushing the water clean. Crews use nets, cables, or machines that set the bombs off at a distance. You meet the word in news about the navy, harbours, and old wars, not in ordinary talk at home. Though actually, many students know Minesweeper as a computer game with little squares: that game only borrowed the name. The real thing is a ship, and the “mine” here is an underwater bomb, not a hole in the ground where people dig coal.
掃雷艦（電腦遊戲「踩地雷」只是借用這個名字）
組成mine（水雷：水裡的炸彈）+ sweeper（清掃、排除的裝置或人）
同家族的字
- minethe underwater bomb this ship looks for
- sweepto clear a path, here through the sea
- minesweepingthe work of clearing those bombs
原始詞典資料3 筆記錄
以下是外部詞典記錄的用法，原文照列，我們還沒有寫成教學內容。上面的說明才是我們自己寫的；有些用法可能上面已經講過了。
minesweepernoun/ˈmaɪnˌswipɚ/
- 1
A vehicle, device, or person with the purpose of removing explosive mines (landmines or naval mines).
- 2
A vehicle, device, or person with the purpose of removing explosive mines (landmines or naval mines).
- 3
computingengineeringmathematicsAny of various logic-based computer games in which the player has to discover the position of mines in a rectangular grid, based on numerical hints.
- Information on the history of minesweeper and the rules of the game can be found on Wikipedia [14]. The book by Garey and Johnson [4] is the classical text on NP-completeness. Boolean satisfiability, SAT, is the original decision problem shown NP-complete by Cook [2]. […] Kaye [6] introduced minesweeper consistency and showed its NP-completeness through reduction from circuit-SAT. Kaye's circuit templates are quite involved. An and gate, for instance, has 23 × 13 squares and a wire crossing is built from and and not gates (24 in total). He later published some further, simplified templates [7), but they remain quite large. Kaye's reduction from circuit-SAT to minesweeper does not guarantee a predefined number of hidden mines. We re-establish the NP-completeness of minesweeper consistency by reduction from SAT for the original version of minesweeper with a given number of hidden mines. This illustrates that this extra piece of information does not fundamentally simplify minesweeper. The latter was also already observed by Scott et al. [8]. Scott et al. argue that Kaye's reasoning does not prove NP-completeness of playing minesweeper. Kaye assumed that minesweeper is played by iteratively solving minesweeper consistency. Scott et al. observe that there may be other strategies to play minesweeper. They therefore introduce the minesweeper inference problem, which precisely captures the essence of minesweeper game play. They show that minesweeper inference is co-NP-complete (and hence that playing minesweeper is most likely not NP-complete). They do so by reducing UNSAT to minesweeper inference, for the original version of minesweeper with a given number of hidden mines.
資料來源：英文維基詞典 English Wiktionary（CC BY-SA 4.0）。 原文照列，未經改寫。