Java program to play minesweeper , JAVA Programming

Assignment Help:

Project Requirements

  1. Write and test a Java program to play Minesweeper using Model-View-Presenter design (The model is an interface defining the data to be displayed or otherwise acted upon in the user interface.
  2. The view is an interface that displays data (the model) and routes user commands (events) to the presenter to act upon that data.
  3. The presenter acts upon the model and the view. It retrieves data from repositories (the model), and formats it for display in the view.)

This project is divided into three tiers. You must complete one tier before beginning the next.

Tier 1
Implement the basic Minesweeper functionality:

1. Determine the neighbor count (i.e., for each cell, count the number of neighbors that are mines).

2. If the user selects a cell that is blank (i.e., no mines as neighbors) show all eight cells immediately surrounding the selected cell. If the selected cell is near an edge, be sure not go out of bounds.

3. If the user selects a cell that is non-blank (i.e., mines as neighbors), display only that cell number.

4. When all non-mine cells have been selected, display a JOptionPane message showing that the user has won.

5. When a mine cell is selected, show a JOptionPane message that indicates the user lost.

6. For this tier, your main method may hard-code the size of the board; but your GUI and your game engine should not make assumptions about the board size.

7. The game board should show the location of the mines. (This makes your project much easier to grade.)

Tier 2
Make the game more complete and give the user more options:

1. Allow the user to specify the number of mines and size of the board to be used. There are several ways you can do this.
o Use command-line parameters
o Create a new dialog window
o Use JOptionPane.showInputDialog
Be sure to perform bounds checking on the user input. The game should not crash if the user specifies a board size of "-6 x tomorrow".

2. Allow the user to flag cells. You may use any reasonable mechanism to flag cells.

3. Allow the user to show or hide the location of the mines. (In other words, give the game a "real game" mode and an "instructor demo" mode.)

Tier 3
Make the game fully operational:

1. If the selected cell is blank, show all blank cells connected to the current cell. (This task will be demonstrated in class and shown using the online Minesweeper games.)

2. Use the right mouse click to flag a cell. Suggestion: use a search engine with the following search words: Java right click.


Related Discussions:- Java program to play minesweeper

Java., the textbok is Introduction to Java™ Programming, Brief Version, Eig...

the textbok is Introduction to Java™ Programming, Brief Version, Eighth Edition Week 8 Exercises Chapter 8 Programming Exercises from Pages 295 - 299. Do Exercise Problems 2,

Program to read a keyboard value and exit from the code, Using the above t...

Using the above thread program, now create 20 threads in your program and run them. No need to wait for the keyboard in each thread, just print "Hello" and its thread id in each t

Difference between pre-emptive scheduling and time slicing, Explain the dif...

Explain the difference between pre-emptive scheduling and time slicing ?

Online Music Store, Online music store that stores information about song, ...

Online music store that stores information about song, artist, album, customer, playlist. Also all necessary diagrams - use case, uml, erd

Project, Hey, i have a project on java can you help me

Hey, i have a project on java can you help me

Write a program using local variable, Write a program using local variable ...

Write a program using local variable Public void someMethod( ) { int x; //local variable System.out.println(x); // compile time error } - Constructor - Doesn't

Constructors or destructors in java program, Consider the following Java de...

Consider the following Java definition of an integer list class. class IntegerList { private int[] list = new int[200]; private int size = 0; public boolean append(int value) {

Implementation of Kruskal’s Algorithm, • A Graph Data Type (including a dis...

• A Graph Data Type (including a display method to show adjacencies) • A Cycle Checker (as described in lecture notes) • An Edge class • A sorting algorithm to sort an array of Edg

What is best algorithm, What is best algorithm? Greedy algorithm is the...

What is best algorithm? Greedy algorithm is the best algorithm as it is n algorithm in which always takes the best immediate, or local solution although searching an answer.

Differentiate between onload and onunload, Differentiate between onLoad and...

Differentiate between onLoad and onUnload? Onload executes the particular javascript code when a latest document is loaded into a windows. ONUnload executes he particular javas

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd