Revision as of 13:21, 11 October 2017 (view source) Nigel Galloway (talk \| contribs) (→‎The Solver) ← Older edit		Revision as of 13:42, 11 October 2017 (view source) Nigel Galloway (talk \| contribs) (→‎The Solver) Newer edit →
Line 50: void fN(const N n, const int g){ const int i{std::get<0>(n)}, e{std::get<1>(n)}, l{std::get<3>(n).back()}; switch(i){case 0: switch(e){case 0: switch(l){case 'l': fZ(fI(n),g); ~~break~~return; case 'u': fZ(fE(n),g); ~~break~~return; default : fZ(fE(n),g); fZ(fI(n),g); ~~break~~return;} ~~break;~~ case 3: switch(l){case 'r': fZ(fI(n),g); ~~break~~return; case 'u': fZ(fL(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fI(n),g); ~~break~~return;} ~~break;~~ default: switch(l){case 'l': fZ(fI(n),g); fZ(fL(n),g); ~~break~~return; case 'r': fZ(fI(n),g); fZ(fE(n),g); ~~break~~return; case 'u': fZ(fE(n),g); fZ(fL(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fI(n),g); fZ(fE(n),g); ~~break~~return;} ~~break;~~} ~~break;~~ case 3: switch(e){case 0: switch(l){case 'l': fZ(fG(n),g); ~~break~~return; case 'd': fZ(fE(n),g); ~~break~~return; default : fZ(fE(n),g); fZ(fG(n),g); ~~break~~return;} ~~break;~~ case 3: switch(l){case 'r': fZ(fG(n),g); ~~break~~return; case 'd': fZ(fL(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fG(n),g); ~~break~~return;} ~~break;~~ default: switch(l){case 'l': fZ(fG(n),g); fZ(fL(n),g); ~~break~~return; case 'r': fZ(fG(n),g); fZ(fE(n),g); ~~break~~return; case 'd': fZ(fE(n),g); fZ(fL(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fG(n),g); fZ(fE(n),g); ~~break~~return;} ~~break;~~} ~~break;~~ default: switch(e){case 0: switch(l){case 'l': fZ(fI(n),g); fZ(fG(n),g); ~~break~~return; case 'u': fZ(fE(n),g); fZ(fG(n),g); ~~break~~return; case 'd': fZ(fE(n),g); fZ(fI(n),g); ~~break~~return; default : fZ(fE(n),g); fZ(fI(n),g); fZ(fG(n),g); ~~break~~return;} ~~break;~~ case 3: switch(l){case 'd': fZ(fI(n),g); fZ(fL(n),g); ~~break~~return; case 'u': fZ(fL(n),g); fZ(fG(n),g); ~~break~~return; case 'r': fZ(fI(n),g); fZ(fG(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fI(n),g); fZ(fG(n),g); ~~break~~return;} ~~break;~~ default: switch(l){case 'd': fZ(fI(n),g); fZ(fL(n),g); fZ(fE(n),g); ~~break~~return; case 'l': fZ(fI(n),g); fZ(fL(n),g); fZ(fG(n),g); ~~break~~return; case 'r': fZ(fI(n),g); fZ(fE(n),g); fZ(fG(n),g); ~~break~~return; case 'u': fZ(fE(n),g); fZ(fL(n),g); fZ(fG(n),g); ~~break~~return; default : fZ(fL(n),g); fZ(fI(n),g); fZ(fE(n),g); fZ(fG(n),g); ~~break~~return;} ~~break;~~} ~~break;~~} } void Solve(N n){for(int g{};;++g) fN(n,g);}

15 puzzle solver: Difference between revisions

15 puzzle solver (view source)

Revision as of 13:42, 11 October 2017