Jump to content

  • Log In with Google      Sign In   
  • Create Account

We're offering banner ads on our site from just $5!

1. Details HERE. 2. GDNet+ Subscriptions HERE. 3. Ad upload HERE.


#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