Anonymous user
Solve a Numbrix puzzle: Difference between revisions
→{{header|C++}}
Line 117:
bool search( int x, int y, int w, int dr )
{
if( ( w > max && dr > 0 ) || ( w < 1 && dr < 0 ) || ( w == max && weHave[w] ) ) return true;
node* n = &arr[x + y * wid];
| |||