blocks|key|4077755|text|请检查以下代码：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4077756|​|4077757|//+we+start+with+an+empty+sudoku...
var+sudoku+=+new+Array(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0);
+
//+...+and+we+solve+it!!
solve(sudoku);
+
//+given+a+sudoku+cell,+returns+the+row
function+returnRow(cell)+{
	return+Math.floor(cell+/+9);
}
+
//+given+a+sudoku+cell,+returns+the+column
function+returnCol(cell)+{
	return+cell+%25+9;
}
+
//+given+a+sudoku+cell,+returns+the+3x3+block
function+returnBlock(cell)+{
	return+Math.floor(returnRow(cell)+/+3)+*+3+%2B+Math.floor(returnCol(cell)+/+3);
}
+
//+given+a+number,+a+row+and+a+sudoku,+returns+true+if+the+number+can+be+placed+in+the+row
function+isPossibleRow(number,row,sudoku)+{
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		if+(sudoku[row*9%2Bi]+==+number)+{
			return+false;
		}
	}
	return+true;
}
+
//+given+a+number,+a+column+and+a+sudoku,+returns+true+if+the+number+can+be+placed+in+the+column
function+isPossibleCol(number,col,sudoku)+{
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		if+(sudoku[col%2B9*i]+==+number)+{
			return+false;
		}
	}
	return+true;
}
+
//+given+a+number,+a+3x3+block+and+a+sudoku,+returns+true+if+the+number+can+be+placed+in+the+block
function+isPossibleBlock(number,block,sudoku)+{
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		if+(sudoku[Math.floor(block/3)*27%2Bi%253%2B9*Math.floor(i/3)%2B3*(block%253)]+==+number)+{
			return+false;
		}
	}
	return+true;
}
+
//+given+a+cell,+a+number+and+a+sudoku,+returns+true+if+the+number+can+be+placed+in+the+cell
function+isPossibleNumber(cell,number,sudoku)+{
	var+row+=+returnRow(cell);
	var+col+=+returnCol(cell);
	var+block+=+returnBlock(cell);
	return+isPossibleRow(number,row,sudoku)+&&+isPossibleCol(number,col,sudoku)+&&+isPossibleBlock(number,block,sudoku);
}
+
//+given+a+row+and+a+sudoku,+returns+true+if+it's+a+legal+row
function+isCorrectRow(row,sudoku)+{
	var+rightSequence+=+new+Array(1,2,3,4,5,6,7,8,9);
	var+rowTemp=+new+Array();
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		rowTemp[i]+=+sudoku[row*9%2Bi];
	}
	rowTemp.sort();
	return+rowTemp.join()+==+rightSequence.join();
}
+
//+given+a+column+and+a+sudoku,+returns+true+if+it's+a+legal+column
function+isCorrectCol(col,sudoku)+{
	var+rightSequence+=+new+Array(1,2,3,4,5,6,7,8,9);
	var+colTemp=+new+Array();
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		colTemp[i]+=+sudoku[col%2Bi*9];
	}
	colTemp.sort();
	return+colTemp.join()+==+rightSequence.join();
}
+
//+given+a+3x3+block+and+a+sudoku,+returns+true+if+it's+a+legal+block+
function+isCorrectBlock(block,sudoku)+{
	var+rightSequence+=+new+Array(1,2,3,4,5,6,7,8,9);
	var+blockTemp=+new+Array();
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		blockTemp[i]+=+sudoku[Math.floor(block/3)*27%2Bi%253%2B9*Math.floor(i/3)%2B3*(block%253)];
	}
	blockTemp.sort();
	return+blockTemp.join()+==+rightSequence.join();
}
+
//+given+a+sudoku,+returns+true+if+the+sudoku+is+solved
function+isSolvedSudoku(sudoku)+{
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		if+(!isCorrectBlock(i,sudoku)+%7C%7C+!isCorrectRow(i,sudoku)+%7C%7C+!isCorrectCol(i,sudoku))+{
			return+false;
		}
	}
	return+true;
}
+
//+given+a+cell+and+a+sudoku,+returns+an+array+with+all+possible+values+we+can+write+in+the+cell
function+determinePossibleValues(cell,sudoku)+{
	var+possible+=+new+Array();
	for+(var+i=1;+i<=9;+i%2B%2B)+{
		if+(isPossibleNumber(cell,i,sudoku))+{
			possible.unshift(i);
		}
	}
	return+possible;
}
+
//+given+an+array+of+possible+values+assignable+to+a+cell,+returns+a+random+value+picked+from+the+array
function+determineRandomPossibleValue(possible,cell)+{
	var+randomPicked+=+Math.floor(Math.random()+*+possible[cell].length);
	return+possible[cell][randomPicked];
}
+
//+given+a+sudoku,+returns+a+two+dimension+array+with+all+possible+values+
function+scanSudokuForUnique(sudoku)+{
	var+possible+=+new+Array();
	for+(var+i=0;+i<=80;+i%2B%2B)+{
		if+(sudoku[i]+==+0)+{
			possible[i]+=+new+Array();
			possible[i]+=+determinePossibleValues(i,sudoku);
			if+(possible[i].length==0)+{
				return+false;
			}
		}
	}
	return+possible;
}
+
//+given+an+array+and+a+number,+removes+the+number+from+the+array
function+removeAttempt(attemptArray,number)+{
	var+newArray+=+new+Array();
	for+(var+i=0;+i<attemptArray.length;+i%2B%2B)+{
		if+(attemptArray[i]+!=+number)+{
			newArray.unshift(attemptArray[i]);
		}
	}
	return+newArray;
}
+
//+given+a+two+dimension+array+of+possible+values,+returns+the+index+of+a+cell+where+there+are+the+less+possible+numbers+to+choose+from
function+nextRandom(possible)+{
	var+max+=+9;
	var+minChoices+=+0;
	for+(var+i=0;+i<=80;+i%2B%2B)+{
		if+(possible[i]!=undefined)+{
			if+((possible[i].length<=max)+&&+(possible[i].length>0))+{
				max+=+possible[i].length;
				minChoices+=+i;
			}
		}
	}
	return+minChoices;
}
+
//+given+a+sudoku,+solves+it
function+solve(sudoku)+{
	var+saved+=+new+Array();
	var+savedSudoku+=+new+Array();
	var+i=0;
	var+nextMove;
	var+whatToTry;
	var+attempt;
	while+(!isSolvedSudoku(sudoku))+{
		i%2B%2B;
		nextMove+=+scanSudokuForUnique(sudoku);
		if+(nextMove+==+false)+{
			nextMove+=+saved.pop();
			sudoku+=+savedSudoku.pop();
		}
		whatToTry+=+nextRandom(nextMove);
		attempt+=+determineRandomPossibleValue(nextMove,whatToTry);
		if+(nextMove[whatToTry].length>1)+{
			nextMove[whatToTry]+=+removeAttempt(nextMove[whatToTry],attempt);
			saved.push(nextMove.slice());
			savedSudoku.push(sudoku.slice());
		}
		sudoku[whatToTry]+=+attempt;
	}
	showSudoku(sudoku,i);
}
+
function+showSudoku(sudoku,i)+{
	var+sudokuText+=+"<table+border='1'>";
	for+(var+i=0;+i<=8;+i%2B%2B)+{
		sudokuText%2B="<tr>";
		for+(var+j=0;+j<=8;+j%2B%2B)+{
			sudokuText%2B="<td>";
			sudokuText%2B=sudoku[i*9%2Bj];
			sudokuText%2B="</td>";
		}
		sudokuText%2B="</tr>";
	}
	sudokuText%2B="</table>";
	document.write(sudokuText);
}|code-block|syntax|javascript|4077758|table+{
++++display:table;
++++border:+2px+solid+#444;
++++border-collapse:+collapse;
++++position:+relative;
}
table+tr+{
++++display:table-row;
++++position:+relative;
++++z-index:-1;
}
table+td{
++++display:table-cell;
++++padding:8px;
++++border:+1px+solid+#ff0000;
++++text-align:+center;
}

table+td:nth-child(3),+table+td:nth-child(6){border-right:+5px+solid+#555;+}+/*vertical*/
table+tr:nth-child(3)+td,+table+tr:nth-child(6)+td{border-bottom:+5px+solid+#555;}++/*horizontal*/|4077759|4077760|我希望它能对你有所帮助。谢谢|4077761|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|R|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|F|7|S|8|@]|9|@]|A|$G|H]]|$1|K|3|C|5|6|7|T|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|U|8|@]|9|@]|A|$]]|$1|N|3|-4|5|6|7|V|8|@]|9|@]|A|$]]]|O|$]]

<p>Please check below code:</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code> 
// we start with an empty sudoku...
var sudoku = new Array(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0);
 
// ... and we solve it!!
solve(sudoku);
 
// given a sudoku cell, returns the row
function returnRow(cell) {
	return Math.floor(cell / 9);
}
 
// given a sudoku cell, returns the column
function returnCol(cell) {
	return cell % 9;
}
 
// given a sudoku cell, returns the 3x3 block
function returnBlock(cell) {
	return Math.floor(returnRow(cell) / 3) * 3 + Math.floor(returnCol(cell) / 3);
}
 
// given a number, a row and a sudoku, returns true if the number can be placed in the row
function isPossibleRow(number,row,sudoku) {
	for (var i=0; i&lt;=8; i++) {
		if (sudoku[row*9+i] == number) {
			return false;
		}
	}
	return true;
}
 
// given a number, a column and a sudoku, returns true if the number can be placed in the column
function isPossibleCol(number,col,sudoku) {
	for (var i=0; i&lt;=8; i++) {
		if (sudoku[col+9*i] == number) {
			return false;
		}
	}
	return true;
}
 
// given a number, a 3x3 block and a sudoku, returns true if the number can be placed in the block
function isPossibleBlock(number,block,sudoku) {
	for (var i=0; i&lt;=8; i++) {
		if (sudoku[Math.floor(block/3)*27+i%3+9*Math.floor(i/3)+3*(block%3)] == number) {
			return false;
		}
	}
	return true;
}
 
// given a cell, a number and a sudoku, returns true if the number can be placed in the cell
function isPossibleNumber(cell,number,sudoku) {
	var row = returnRow(cell);
	var col = returnCol(cell);
	var block = returnBlock(cell);
	return isPossibleRow(number,row,sudoku) &amp;&amp; isPossibleCol(number,col,sudoku) &amp;&amp; isPossibleBlock(number,block,sudoku);
}
 
// given a row and a sudoku, returns true if it's a legal row
function isCorrectRow(row,sudoku) {
	var rightSequence = new Array(1,2,3,4,5,6,7,8,9);
	var rowTemp= new Array();
	for (var i=0; i&lt;=8; i++) {
		rowTemp[i] = sudoku[row*9+i];
	}
	rowTemp.sort();
	return rowTemp.join() == rightSequence.join();
}
 
// given a column and a sudoku, returns true if it's a legal column
function isCorrectCol(col,sudoku) {
	var rightSequence = new Array(1,2,3,4,5,6,7,8,9);
	var colTemp= new Array();
	for (var i=0; i&lt;=8; i++) {
		colTemp[i] = sudoku[col+i*9];
	}
	colTemp.sort();
	return colTemp.join() == rightSequence.join();
}
 
// given a 3x3 block and a sudoku, returns true if it's a legal block 
function isCorrectBlock(block,sudoku) {
	var rightSequence = new Array(1,2,3,4,5,6,7,8,9);
	var blockTemp= new Array();
	for (var i=0; i&lt;=8; i++) {
		blockTemp[i] = sudoku[Math.floor(block/3)*27+i%3+9*Math.floor(i/3)+3*(block%3)];
	}
	blockTemp.sort();
	return blockTemp.join() == rightSequence.join();
}
 
// given a sudoku, returns true if the sudoku is solved
function isSolvedSudoku(sudoku) {
	for (var i=0; i&lt;=8; i++) {
		if (!isCorrectBlock(i,sudoku) || !isCorrectRow(i,sudoku) || !isCorrectCol(i,sudoku)) {
			return false;
		}
	}
	return true;
}
 
// given a cell and a sudoku, returns an array with all possible values we can write in the cell
function determinePossibleValues(cell,sudoku) {
	var possible = new Array();
	for (var i=1; i&lt;=9; i++) {
		if (isPossibleNumber(cell,i,sudoku)) {
			possible.unshift(i);
		}
	}
	return possible;
}
 
// given an array of possible values assignable to a cell, returns a random value picked from the array
function determineRandomPossibleValue(possible,cell) {
	var randomPicked = Math.floor(Math.random() * possible[cell].length);
	return possible[cell][randomPicked];
}
 
// given a sudoku, returns a two dimension array with all possible values 
function scanSudokuForUnique(sudoku) {
	var possible = new Array();
	for (var i=0; i&lt;=80; i++) {
		if (sudoku[i] == 0) {
			possible[i] = new Array();
			possible[i] = determinePossibleValues(i,sudoku);
			if (possible[i].length==0) {
				return false;
			}
		}
	}
	return possible;
}
 
// given an array and a number, removes the number from the array
function removeAttempt(attemptArray,number) {
	var newArray = new Array();
	for (var i=0; i&lt;attemptArray.length; i++) {
		if (attemptArray[i] != number) {
			newArray.unshift(attemptArray[i]);
		}
	}
	return newArray;
}
 
// given a two dimension array of possible values, returns the index of a cell where there are the less possible numbers to choose from
function nextRandom(possible) {
	var max = 9;
	var minChoices = 0;
	for (var i=0; i&lt;=80; i++) {
		if (possible[i]!=undefined) {
			if ((possible[i].length&lt;=max) &amp;&amp; (possible[i].length&gt;0)) {
				max = possible[i].length;
				minChoices = i;
			}
		}
	}
	return minChoices;
}
 
// given a sudoku, solves it
function solve(sudoku) {
	var saved = new Array();
	var savedSudoku = new Array();
	var i=0;
	var nextMove;
	var whatToTry;
	var attempt;
	while (!isSolvedSudoku(sudoku)) {
		i++;
		nextMove = scanSudokuForUnique(sudoku);
		if (nextMove == false) {
			nextMove = saved.pop();
			sudoku = savedSudoku.pop();
		}
		whatToTry = nextRandom(nextMove);
		attempt = determineRandomPossibleValue(nextMove,whatToTry);
		if (nextMove[whatToTry].length&gt;1) {
			nextMove[whatToTry] = removeAttempt(nextMove[whatToTry],attempt);
			saved.push(nextMove.slice());
			savedSudoku.push(sudoku.slice());
		}
		sudoku[whatToTry] = attempt;
	}
	showSudoku(sudoku,i);
}
 
function showSudoku(sudoku,i) {
	var sudokuText = "&lt;table border='1'&gt;";
	for (var i=0; i&lt;=8; i++) {
		sudokuText+="&lt;tr&gt;";
		for (var j=0; j&lt;=8; j++) {
			sudokuText+="&lt;td&gt;";
			sudokuText+=sudoku[i*9+j];
			sudokuText+="&lt;/td&gt;";
		}
		sudokuText+="&lt;/tr&gt;";
	}
	sudokuText+="&lt;/table&gt;";
	document.write(sudokuText);
}</code></pre>
<pre class="snippet-code-css lang-css prettyprint-override"><code>table {
    display:table;
    border: 2px solid #444;
    border-collapse: collapse;
    position: relative;
}
table tr {
    display:table-row;
    position: relative;
    z-index:-1;
}
table td{
    display:table-cell;
    padding:8px;
    border: 1px solid #ff0000;
    text-align: center;
}

table td:nth-child(3), table td:nth-child(6){border-right: 5px solid #555; } /*vertical*/
table tr:nth-child(3) td, table tr:nth-child(6) td{border-bottom: 5px solid #555;}  /*horizontal*/</code></pre>
</div>
</div>
</p>

<p>I hope it might by helpful.
Thanks</p>


blocks|key|4079208|text|首先创建一个包含81个Position对象的数组。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4079209|function+Pos()+{
}

const+board+=+[];
for+(let+i+=+0;+i+<+81;+i%2B%2B)+{
++board.push(new+Pos())
}|code-block|syntax|javascript|4079210|遍历数组(可能会循环几次)并创建3个数组数组；垂直线、水平线和9个部分|4079211|const+xLines+=+[[],+...],
++++++yLines+=+[[],+...],
++++++sLines+=+[[],+...];|4079212|当然，这些数组中的每个数组应该有9个数组。使用对board变量中Position对象的引用填充它们。|4079213|让board变量中的每个位置引用其水平/垂直线和截面数组。|4079214|//81+objects
//board+=+[{x,+y,+s,+xArr,+yArr,+sectionArr},+..]|4079215|现在，您将能够生成数字，知道哪些数字已经被获取。|4079216|专业技巧:一次生成一条水平线(当您到达第3行时，每个部分只有3个可能的数字)|4079217|entityMap^0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Y|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|10|8|@]|9|@]|A|$]]|$1|M|3|N|5|6|7|11|8|@]|9|@]|A|$]]|$1|O|3|P|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|Q|3|R|5|6|7|13|8|@]|9|@]|A|$]]|$1|S|3|T|5|6|7|14|8|@]|9|@]|A|$]]|$1|U|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|V|$]]

<p>First create an array of 81 Position objects.</p>

<pre><code>function Pos() {
}

const board = [];
for (let i = 0; i &lt; 81; i++) {
  board.push(new Pos())
}
</code></pre>

<p>Loop through the array (perhaps a few times) and create 3 arrays of arrays;
vertical lines
horizontal lines
and the 9 sections</p>

<pre><code>const xLines = [[], ...],
      yLines = [[], ...],
      sLines = [[], ...];
</code></pre>

<p>Each of these arrays should have 9 arrays of course.
Populate them with references to the Position objects in the board variable.</p>

<p>Let each position in the board variable reference its horizontal/vertical line and section arrays.</p>

<pre><code>//81 objects
//board = [{x, y, s, xArr, yArr, sectionArr}, ..]
</code></pre>

<p>now you'll be able to generate numbers, knowing which ones are already taken.</p>

<p>Pro tip:
generate one horizontal line at a time (when you reach the 3rd, there is only 3 possible digits for each section)</p>


<p>I am trying to randomly fill a 2 dimensional array in JS but i want to have the numbers generated in each row and column to be unique.Here is my progression.This can do it for 3x3 grid I mean randomly generated numbers but I want the size of 9x9 like a real sudoku.Thanx.</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>//create table
function UpdateTable() {
	var arr = [];
	while(arr.length &lt; 10){
		var randomnumber = Math.floor(Math.random()*10);
		if(arr.indexOf(randomnumber) &gt; -1 ) continue;
		arr[arr.length] = randomnumber;
	}

	tmp1 = 'cell' + 1;
	tmp2 = 'cell' + 2;
	tmp3 = 'cell' + 3;
	tmp4 = 'cell' + 4;
	tmp5 = 'cell' + 5;
	tmp6 = 'cell' + 6;
	tmp7 = 'cell' + 7;
	tmp8 = 'cell' + 8;
	tmp9 = 'cell' + 9;

	var temp = [tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7, tmp8, tmp9];

	for (var i = 0; i &lt; 10; i++) {
		document.getElementById(temp[i]).innerHTML = arr[i];
	}	
} 


UpdateTable();</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;center&gt;
	&lt;div id="container"&gt;
		&lt;div id="header"&gt;
			 &lt;h1&gt;Welcome&lt;/h1&gt; 
		&lt;/div&gt;
		&lt;div id="content"&gt;
			&lt;table border="1" id="lotto"&gt;
				&lt;tr class="tr1"&gt;
					&lt;td class="normal" id="cell1"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell2"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell3"&gt;&amp;nbsp;&lt;/td&gt;
				&lt;/tr&gt;
				&lt;tr class="tr2"&gt;
					&lt;td class="normal" id="cell4"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell5"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell6"&gt;&amp;nbsp;&lt;/td&gt;

				&lt;/tr&gt;
				&lt;tr class="tr3"&gt;
					&lt;td class="normal" id="cell7"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell8"&gt;&amp;nbsp;&lt;/td&gt;
					&lt;td class="normal" id="cell9"&gt;&amp;nbsp;&lt;/td&gt;
				&lt;/tr&gt;
			&lt;/table&gt;
		&lt;/div&gt;
	&lt;/div&gt;
	&lt;input type="button" value="Re-generate Numbers" onclick="UpdateTable();" /&gt;
&lt;/center&gt;</code></pre>
</div>
</div>
</p>


Sudoku in JS and HTML

我试图在JS中随机填充一个二维数组，但我希望每行每列生成的数字都是unique.Here，我的progression.This可以处理3x3网格，我的意思是随机生成的数字，但我想要9x9的大小，就像真正的sudoku.Thanx。​//create tablefunction UpdateTable() {var ar...

问JS和HTML中的数独
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问JS和HTML中的数独EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问JS和HTML中的数独
EN