Now save color of cells.

Backward compatibility with previous save encoding.
Arrow keys now skip over clues during navigation.

Author: intrepidcoder

Encoding.js

@@ -4,12 +4,7 @@ function encode(input) {
 	var num;
 	var factor;
 	var str;
-	
-	// cells.getColorIndex("red");
-	// cells.getColorValue(4);
-	// cells.blankCellColor
-	// currentCell.element.classList
-
+	var encodingList = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];
 
 	for (var i = 0; i < 81; i++) {
 		currentCell = cells[i];
@@ -29,17 +24,24 @@ function encode(input) {
 		num += factor * (currentCell.isGiven ? 1 : 0);
 		factor *= 2;
 
-		str = num.toString(36);
+		num += factor * currentCell.getColor();
+		factor *= 5;
+		
+		str = encodingList[num / 3844 | 0];
+		str += encodingList[(num / 62 | 0) % 62];
+		str += encodingList[num % 62];
 
 		while (str.length < 3) { 
 			str = "0" + str;
 		}
 
 		result += str;
 	}
+	
+	result += cells.blankCellColor;
+	
 	return result;
 
-
 }
 
 function decode(input) {
@@ -48,16 +50,31 @@ function decode(input) {
 	var str;
 	var num;
 	var factor;
+	var values = "";
+	var decodingList = {"0":0, "1":1, "2":2, "3":3, "4":4, "5":5, "6":6, "7":7, "8":8, "9":9, "A":10, "B":11, "C":12, "D":13, "E":14, "F":15, "G":16, "H":17, "I":18, "J":19, "K":20, "L":21, "M":22, "N":23, "O":24, "P":25, "Q":26, "R":27, "S":28, "T":29, "U":30, "V":31, "W":32, "X":33, "Y":34, "Z":35, "a":36, "b":37, "c":38, "d":39, "e":40, "f":41, "g":42, "h":43, "i":44, "j":45, "k":46, "l":47, "m":48, "n":49, "o":50, "p":51, "q":52, "r":53, "s":54, "t":55, "u":56, "v":57, "w":58, "x":59, "y":60, "z":61};
+	var colorsEncoded = true;
+	
+	input = input.replace(/[^0-9A-Za-z]/g, "")
 
-	if (input.length !== 243) {
+	if (input.length !== 243 && input.length !== 244) {
+		alert("Invalid input.");
 		return;
 	}
 
+	colorsEncoded = input.length === 244;
+	
 	for (var i = 0; i < 81; i++) {
 		currentCell = cells[i];
 
 		factor = 1;
-		num = parseInt(input.slice(i * 3, i * 3 + 3), 36);
+		
+		if (colorsEncoded) {
+			num = decodingList[input.charAt(i * 3)] * 3844;
+			num += decodingList[input.charAt(i * 3 + 1)] * 62;
+			num += decodingList[input.charAt(i * 3 + 2)];
+		} else {
+			num = parseInt(input.slice(i * 3, i * 3 + 3), 36);
+		}
 
 		for (var j = 0; j < 9; j++) {
 			factor = 2;
@@ -69,28 +86,68 @@ function decode(input) {
 
 		factor = 10;
 		currentCell.setValue(num % factor);
+		values += num % factor + "";
 		num = (num / factor) | 0;
 
 		factor = 2;
 		currentCell.isGiven = !!(num % factor);
 		num = (num / factor) | 0;
 
+		factor = 5;
+		currentCell.setColor(num % factor);
+		num = (num / factor) | 0;
+		
 		if (currentCell.isGiven) {
 			currentCell.element.innerHTML = currentCell.value;
+			currentCell.candidatesElement.innerHTML = currentCell.value;
 		} else {
 			if (currentCell.value) {
 				currentCell.element.firstChild.value = currentCell.value;
+				currentCell.candidatesElement.innerHTML = currentCell.value;
 			} else {
+				// Update pencilmarks display.
+				currentCell.candidatesElement.innerHTML = currentCell.getPencilmarkString();
 				currentCell.element.firstChild.value = "";
 
 			}
 		}
 
-		// Update pencilmarks display.
-		currentCell.candidatesElement.innerHTML = currentCell.getPencilmarkString();
+	}
+	
+	cells.blankCellColor = parseInt(input.charAt(243));
+	
+	// Highlight selected color link.
+	document.getElementById("mark_blank_cells_0").style.backgroundColor = "";
+	document.getElementById("mark_blank_cells_" + cells.blankCellColor).style.backgroundColor = "#FF8";
+	
+	
+	var puzzle = new Puzzle(values);
+
+	if (!puzzle.hasSolution()) {
+		alert("There is no solution for the inputted values.");
+		return;
 	}
 
-	submitGivens();
+	document.getElementById("top_bar").style.display = "none";
+	document.getElementById("begin_solving").style.display = "none";
+	document.getElementById("controls").style.display = "block";
+	document.getElementById("grid_table").style.position = "static";
+	document.getElementById("grid_table").style.marginTop = "8px";
+	document.getElementById("grid_table").style.marginLeft = "8px";
+	document.getElementById("side_bar").style.display = "none";
+	
+	document.getElementById("import_save_button").title = "This option is disabled when a sudoku puzzle is in progress.";
+	document.getElementById("import_save_button").disabled = true;
+	document.getElementById("paste_puzzle_button").title = "This option is disabled when a sudoku puzzle is in progress.";
+	document.getElementById("paste_puzzle_button").disabled = true;
+	document.getElementById("load_cookie").title = "This option is disabled when a sudoku puzzle is in progress.";
+	document.getElementById("load_cookie").disabled = true;
+	
+	cells.solution = puzzle.toString();
+	for (var i = 0; i < 81; i++) {
+		cells[i].solution = parseInt(cells.solution.charAt(i));
+	}
+	
 	showDuplicates();
 }
 

Puzzle.js

@@ -573,8 +573,6 @@ function Puzzle(givens) {
 	};
 
 
-	// Returns the solution that occurs first in lexicographical order to the puzzle if firstSolution is true.
-	// Otherwise returns the solution that occurs last in lexicographical order.
 	var solve = function solve(givens) {
 		var stack = [];
 		var values;
@@ -599,7 +597,6 @@ function Puzzle(givens) {
 			}
 		}
 
-		console.log("Returned givens.");
 		return givens;
 	};
 

Sudoku.css

@@ -116,7 +116,7 @@ a:active {
 }
 
 #side_bar {
-	width: 450px;
+	width: 460px;
 	z-index: 2;
 	position: fixed;
 	top: 0px;