Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
So my Java minesweeper game is represented as a int[][] where -1 represents a mine. When I initialize my game I need to randomly place x amount of mines.
What is an elegant way of doing this? I was thinking of using an ArrayList with the coordinates of each cell, randomly selecting it, changing the state of the int[][] and then removing that Point. This would ensure that no point is selected twice.
Is there a more elegant way of doing this?
I’d do it similarly, but slightly differently. Use the card-dealing algorithm.
Create an array of all the coordinates in your grid, in order.
([0,0], [0,1] .. [0,max], [1,0] .. [max, max]). Then “shuffle the deck” by iterating the list in order and swapping each element with a random element. Then select the first x elements in the list and place mines in those locations.