Javascript递归数独解算器 const puzzle1=[[0,0,0,2,6,0,7,0,1]， [ 6,8,0,0,7,0,0,9,0], [ 1,9,0,0,0,4,5,0,0], [ 8,2,0,1,0,0,0,4,0], [ 0,0,4,_Javascript_Recursion_Sudoku

Javascript递归数独解算器 const puzzle1=[[0,0,0,2,6,0,7,0,1]， [ 6,8,0,0,7,0,0,9,0], [ 1,9,0,0,0,4,5,0,0], [ 8,2,0,1,0,0,0,4,0], [ 0,0,4,

javascript recursion

Javascript递归数独解算器 const puzzle1=[[0,0,0,2,6,0,7,0,1]， [ 6,8,0,0,7,0,0,9,0], [ 1,9,0,0,0,4,5,0,0], [ 8,2,0,1,0,0,0,4,0], [ 0,0,4,,javascript,recursion,sudoku,Javascript,Recursion,Sudoku,Javascript递归数独解算器 const puzzle1=[[0,0,0,2,6,0,7,0,1]， [ 6,8,0,0,7,0,0,9,0], [ 1,9,0,0,0,4,5,0,0], [ 8,2,0,1,0,0,0,4,0], [ 0,0,4,6,0,2,9,0,0], [ 0,5,0,0,0,3,0,2,8], [ 0,0,9,3,0,0,0,7,4], [ 0,4,0,0,5,0,0,3,6], [ 7,0,3,0,1,8,0,0,0]]; 常数2=[[5,8,1,6,7,2,4

Javascript递归数独解算器

const puzzle1=[[0,0,0,2,6,0,7,0,1]，
[ 6,8,0,0,7,0,0,9,0],
[ 1,9,0,0,0,4,5,0,0],
[ 8,2,0,1,0,0,0,4,0],
[ 0,0,4,6,0,2,9,0,0],
[ 0,5,0,0,0,3,0,2,8],
[ 0,0,9,3,0,0,0,7,4],
[ 0,4,0,0,5,0,0,3,6],
[ 7,0,3,0,1,8,0,0,0]];
常数2=[[5,8,1,6,7,2,4,3,9]，
[ 7,9,2,8,4,3,6,5,1],
[ 3,6,4,5,9,1,7,8,2],
[ 4,3,8,9,5,7,2,1,6],
[ 2,5,6,1,8,4,9,7,3],
[ 1,7,9,3,2,6,8,4,5],
[ 8,4,5,2,1,9,3,6,7],
[ 9,1,3,7,6,8,5,2,4],
[ 6,2,7,4,3,5,1,0,0]]; // 6,2,7,4,3,5,1,9,8
虚拟变量；
假人=2；
函数poss（x，y，n）{
for（设i=0；iI建议使用for（var x=
和for（var y=）…您编写它的方式，x，y，（和i）是全局的-因此在Solve调用后Solve x和/或y的值将与Solve调用前Solve的值不同，并且可能很容易9@JaromandaX谢谢！这至少解决了问题2，但现在我遇到了一个新问题，我将在几秒钟内更新我的问题。
Uncaught TypeError: Cannot set property '9' of undefined
    at Solve (script.js:57)
    at Solve (script.js:56)
    at <anonymous>:1:1