Jump to content

  • Log In with Google      Sign In   
  • Create Account

FREE SOFTWARE GIVEAWAY

We have 4 x Pro Licences (valued at $59 each) for 2d modular animation software Spriter to give away in this Thursday's GDNet Direct email newsletter.


Read more in this forum topic or make sure you're signed up (from the right-hand sidebar on the homepage) and read Thursday's newsletter to get in the running!


#ActualBackward

Posted 09 May 2013 - 10:11 AM

In your algorithm if i understood well, you put randomly all rest mines and then you check is it possible. But there could be many situations when state is not consistent for example there is a square 2 but there are 3 mines around it. Why don't we find all possible consistent combinations and then check for every square how many times there was a mine? It will be just a kind of special case of your algorithm.


#3Backward

Posted 09 May 2013 - 10:10 AM

In your algorithm if i understood well, you put randomly all rest mines and then you check is it possible. But there could be many situations when state is not consistent for example there is a square 2 but there are 3 mines. Why don't we find all possible consistent combinations and then check for every square how many times there was a mine? It will be just a kind of special case of your algorithm.


#2Backward

Posted 09 May 2013 - 08:56 AM

hmmmm...can you post your .cpp file here?

 

EDIT: Ahhh my mistake. Everything is ok now. 


#1Backward

Posted 09 May 2013 - 08:42 AM

hmmmm...can you post your .cpp file here?


PARTNERS