Check whether two solutions are the same
| 91 | } |
| 92 | /// Check whether two solutions are the same |
| 93 | bool same(const Queens& s) const { |
| 94 | for (int i=0; i<q.size(); i++) |
| 95 | if (q[i].val() != s.q[i].val()) |
| 96 | return false; |
| 97 | return true; |
| 98 | } |
| 99 | /// Return increment for node stop |
| 100 | static unsigned int nodeinc(void) { |
| 101 | return 500; |