var LIGHTCLR = "lime"; var DARKCLR = "green"; var width = 3; var height = 3; var size = width * height; var moves; var minmove; var solvable; var cheating; var building; var lights = []; var original = []; var minsol = []; var minsol_copy = []; // helper functions function encode(i, array) { //Updates array to reflect the effect of //clicking square number i array[i] = !array[i]; if (i % width) array[i - 1] = !array[i - 1]; if ((i+1) % width) array[i + 1] = !array[i + 1]; if (i >= width) array[i - width] = !array[i - width]; if (i + width < size) array[i + width] = !array[i + width]; return array; } function gauss() { //all the math goes here :D //finds all solution using Gaussian //elimination, then determines the //minimal solution by direct comparison var A = [], b = []; var i, j, k, x, t; for (i=0; i=0; j--) { pivot = pivot_list[j]; for (i=0; i= 0) { solution[j] = b[pivot_list[j]]; } else { solution[j] = false; free.push(j); nullity++; if (b[size-nullity]) { solvable = false; return; } } minsol[j] = solution[j]; if (minsol[j]) minmove++; } solvable = true; //find a null basis var null_basis = []; for(k=0; k=0) null_basis[k][i] = A[pivot_list[i]][free[k]]; else if (i===free[k]) null_basis[k][i] = true; else null_basis[k][i] = false; } } //pick every subset of the null basis, //and add them to the initial solution var minsol_finder = []; for (t=1; t < Math.pow(2, nullity); t++) { for (i=0; i= width) switch_light(i - width); if (i+width

Lights Out (Game)