Difference between revisions of "Course:CPSC312-2017-Minesweeper Haskell"

From UBC Wiki
Jump to: navigation, search
(Minesweeper)
(Minesweeper)
Line 38: Line 38:
  
 
===What is the problem?===
 
===What is the problem?===
We'll be using Haskell to create minesweeper, the single player puzzle game. The rules for minesweeper can be found here: https://en.wikipedia.org/wiki/Minesweeper_(video_game)
+
We'll be using Haskell to create the classic single-player puzzle game: minesweeper. The objective of minesweeper is to clear a board of tiles without hitting any of the bombs. The rules for minesweeper can be found here: https://en.wikipedia.org/wiki/Minesweeper_(video_game). Each game will start with a randomly generated 8x8 board. Players will be able to select a tile to clear or flag. A player wins when all bombs have been flagged and all tiles cleared, and loses when a bomb is hit.
  
 
===What is the something extra?===
 
===What is the something extra?===
What is the in-depth aspect you will do? If the problem is related to some other group's project, tell us how they fit together. If in doubt, include the information.
+
We'll be adding a user interface that shows the state of the board, all cleared/flagged tiles, and the number of bombs surrounding each cleared tile.  
  
 
===What did we learn from doing this?===
 
===What did we learn from doing this?===
(This should be written after you have done the work.)  What is the bottom-line? Is logic programming suitable for (part-of) the task?  Make sure you include the evidence for your claims.
+
''(This should be written after you have done the work.)  What is the bottom-line? Is logic programming suitable for (part-of) the task?  Make sure you include the evidence for your claims.''

Revision as of 21:44, 21 November 2017

Wiki.png
Section:
Instructor:
Email:
Office:
Office Hours:
Class Schedule:
Classroom:
Important Course Pages
Syllabus
Lecture Notes
Assignments
Course Discussion
[[Category:]]

Minesweeper

Authors: Phelan H, Mesbah M

What is the problem?

We'll be using Haskell to create the classic single-player puzzle game: minesweeper. The objective of minesweeper is to clear a board of tiles without hitting any of the bombs. The rules for minesweeper can be found here: https://en.wikipedia.org/wiki/Minesweeper_(video_game). Each game will start with a randomly generated 8x8 board. Players will be able to select a tile to clear or flag. A player wins when all bombs have been flagged and all tiles cleared, and loses when a bomb is hit.

What is the something extra?

We'll be adding a user interface that shows the state of the board, all cleared/flagged tiles, and the number of bombs surrounding each cleared tile.

What did we learn from doing this?

(This should be written after you have done the work.) What is the bottom-line? Is logic programming suitable for (part-of) the task? Make sure you include the evidence for your claims.