Javascript 为什么递归wordsearch解算器缺少五个单词，却找到了另外47个？

我正在创建一个递归的wordsearch应用程序，它看起来（在我的业余爱好者看来）是正确的，但缺少53个单词中的5个。单词可以从左到右、从右到左、向上、向下或对角隐藏。我希望控制台输出找到的单词、拼图中的x和y坐标以及方向。我不知疲倦地查看了代码，似乎找不到问题所在。请帮忙

缺少的单词是：

2：备份

29：液晶显示器

40：电源

44：扫描仪

53:无线

代码如下：

我正在从文本区域加载拼图和单词列表：

<textarea name="wordsearch" id="wordsearch" style="display:none">
TPIRCSAVAJLEXIPIGE
LIAMEMORYMMOUSENIL
CRABKSATXINUYHSTFG
DNDIRECTORYETAOEOO
POWERSUPPLYNIRFRLO
UCOASAEVASCCRETNDG
KIROPKTYPSHRUWWEEL
CDDECPREEAHYCAATRM
ANRIMALLTDRPERREAT
BOLENMEIEKETSEEPHH
RCKIPRAFCVRIIRSULM
EEBEIARRIABOOTMBOR
NSTWRAPRGRTNWBINGO
NOOSGNDLOODINTIOIS
ANGMAKAULARAOTEANR
CAEASPTLTAIPONRNDU
SNFIREWALLWREIKOOC
TFDPRDHTOOTEULBYTE</textarea>

<textarea name="wordlist" id="wordlist" style="display:none">
Application
Backup
Binary
Bluetooth
Boot
Byte
Chat
Click
Cookie
Cursor
Data
Defragment
Directory
Disk drive
DOS
Drag
Email
Encryption
File
Firewall
Folder
GIF
Google
HTML
Icon
Internet
JavaScript
Kernal
LCD
Login
Memory
Monitor
Mouse
Nanosecond
Network
Partition
Paste
PDF
Pixel
Power Supply
Programmer
Router
Save As
Scanner
Security
ShareWare
Software
Spam
Taskbar
Thumbnail
UNIX
Wallpaper
Wireless</textarea>
<script src="wordsearch.js" type="text/javascript"></script> 

---

你建立索引或检查边界的方式似乎有问题。老实说，我不能确切地告诉您问题是什么，但我有一个工作版本，它更短，代码重复更少。也许你可以从中得到一些东西

function solvePuzzle() {
  // list of words that were found
  var wFound = [];
  console.log("Number of words:", words.length);
  // loop over words
  for (var i = 0; i < words.length; ++i) {
    var fChar = words[i].charAt(0);
    wordFound:
    // loop over characters
    for (var j = 0; j < rows; ++j) {
      for (var k = 0; k < columns; ++k) {
        // check first character
        if (fChar == puzzle[j].charAt(k)) {
          // iterate over all 9 directions
          for (var dj = -1; dj <= 1; dj++) {
            for (var dk = -1; dk <= 1; dk++) {
              // skip invalid direction
              if (dj == 0 && dk == 0) continue;
              // try to find word
              if (findWord(words[i], 0, j, k, dj, dk)) {
                console.log(i + 1, words[i], k + 1, j + 1, getDirectionString(dj, dk));
                // found a word
                wFound.push(words[i]);
                break wordFound;
              }
            }
          }
        }
      }
    }
  }
  console.log("Number of words found:", wFound.length);
}

function findWord(word, posW, j, k, dj, dk) {
  // check if all characters were found
  if (posW == word.length) return true;
  // check if position is outside the boundaries
  if (j < 0 || j >= rows || k < 0 || k >= columns) return false;
  // check if current character fails to match the word
  if (word.charAt(posW) != puzzle[j].charAt(k)) return false;
  // check next character
  return findWord(word, posW + 1, j + dj, k + dk, dj, dk);
}

function getDirectionString(dj, dk) {
  switch (dj) {
    case -1: switch (dk) { case -1: return "DUL"; case 0: return "U"; case 1: return "DUR"; } break;
    case 0: switch (dk) { case -1: return "RL"; case 1: return "LR"; } break;
    case 1: switch (dk) { case -1: return "DDL"; case 0: return "D"; case 1: return "DDR"; } break;
  }
  return "invalid";
}

---

我相当肯定扫描仪、备份和无线设备都不在里面。。。LCD和电源肯定是这样。@jdpenix:它不包含无线，但包含WIRELESC。其他的都在里面。（备份和扫描都出现在第0列）@Amadan发现了！你是对的。除了无线，所有东西都在里面。感谢您提及备份和扫描仪的位置。在搜索第0列之前，列索引正在递增。非常感谢。

1 "APPLICATION" 4 6 "DDR"
3 "BINARY" 3 12 "DUR"
4 "BLUETOOTH" "RL" 15 18
5 "BOOT" 11 12 "LR"
6 "BYTE" 15 18 "LR"
7 "CHAT" 12 6 "DDL"
8 "CLICK" 2 11 "DUR"
9 "COOKIE" "RL" 18 17
10 "CURSOR" 18 17 "U"
11 "DATA" 11 14 "DDL"
12 "DEFRAGMENT" 10 9 "DDL"
13 "DIRECTORY" 3 4 "LR"
14 "DISKDRIVE" 3 18 "DUR"
15 "DOS" 3 8 "DUR"
16 "DRAG" 6 18 "DUL"
17 "EMAIL" "RL" 5 2
18 "ENCRYPTION" 12 4 "D"
19 "FILE" 8 11 "U"
20 "FIREWALL" 3 17 "LR"
21 "FOLDER" 17 3 "D"
22 "GIF" 17 1 "D"
23 "GOOGLE" 18 6 "U"
24 "HTML" 18 10 "U"
25 "ICON" 2 7 "U"
26 "INTERNET" 16 1 "D"
27 "JAVASCRIPT" "RL" 10 1
28 "KERNAL" 3 11 "DDR"
30 "LOGIN" 17 11 "D"
31 "MEMORY" 4 2 "LR"
32 "MONITOR" 18 11 "DDL"
33 "MOUSE" 11 2 "LR"
34 "NANOSECOND" 2 17 "U"
35 "NETWORK" 16 16 "DUL"
36 "PARTITION" 9 7 "DDR"
37 "PASTE" 6 16 "DUL"
38 "PDF" "RL" 4 18
39 "PIXEL" "RL" 15 1
41 "PROGRAMMER" 12 16 "DUL"
42 "ROUTER" 10 13 "DDL"
43 "SAVEAS" "RL" 10 6
45 "SECURITY" 13 10 "U"
46 "SHAREWARE" 14 2 "D"
47 "SOFTWARE" 15 3 "D"
48 "SPAM" 15 11 "DUR"
49 "TASKBAR" "RL" 8 3
50 "THUMBNAIL" 18 9 "DDL"
51 "UNIX" "RL" 12 3
52 "WALLPAPER" 11 17 "DUL"

function solvePuzzle() {
  // list of words that were found
  var wFound = [];
  console.log("Number of words:", words.length);
  // loop over words
  for (var i = 0; i < words.length; ++i) {
    var fChar = words[i].charAt(0);
    wordFound:
    // loop over characters
    for (var j = 0; j < rows; ++j) {
      for (var k = 0; k < columns; ++k) {
        // check first character
        if (fChar == puzzle[j].charAt(k)) {
          // iterate over all 9 directions
          for (var dj = -1; dj <= 1; dj++) {
            for (var dk = -1; dk <= 1; dk++) {
              // skip invalid direction
              if (dj == 0 && dk == 0) continue;
              // try to find word
              if (findWord(words[i], 0, j, k, dj, dk)) {
                console.log(i + 1, words[i], k + 1, j + 1, getDirectionString(dj, dk));
                // found a word
                wFound.push(words[i]);
                break wordFound;
              }
            }
          }
        }
      }
    }
  }
  console.log("Number of words found:", wFound.length);
}

function findWord(word, posW, j, k, dj, dk) {
  // check if all characters were found
  if (posW == word.length) return true;
  // check if position is outside the boundaries
  if (j < 0 || j >= rows || k < 0 || k >= columns) return false;
  // check if current character fails to match the word
  if (word.charAt(posW) != puzzle[j].charAt(k)) return false;
  // check next character
  return findWord(word, posW + 1, j + dj, k + dk, dj, dk);
}

function getDirectionString(dj, dk) {
  switch (dj) {
    case -1: switch (dk) { case -1: return "DUL"; case 0: return "U"; case 1: return "DUR"; } break;
    case 0: switch (dk) { case -1: return "RL"; case 1: return "LR"; } break;
    case 1: switch (dk) { case -1: return "DDL"; case 0: return "D"; case 1: return "DDR"; } break;
  }
  return "invalid";
}

Number of words: 53
1 "APPLICATION" 4 6 "DDR"
2 "BACKUP" 1 10 "U"
3 "BINARY" 3 12 "DUR"
4 "BLUETOOTH" 15 18 "RL"
5 "BOOT" 11 12 "LR"
6 "BYTE" 15 18 "LR"
7 "CHAT" 12 6 "DDL"
8 "CLICK" 2 11 "DUR"
9 "COOKIE" 18 17 "RL"
10 "CURSOR" 18 17 "U"
11 "DATA" 11 14 "DDL"
12 "DEFRAGMENT" 10 9 "DDL"
13 "DIRECTORY" 3 4 "LR"
14 "DISKDRIVE" 3 18 "DUR"
15 "DOS" 3 8 "DUR"
16 "DRAG" 6 18 "DUL"
17 "EMAIL" 5 2 "RL"
18 "ENCRYPTION" 12 4 "D"
19 "FILE" 8 11 "U"
20 "FIREWALL" 3 17 "LR"
21 "FOLDER" 17 3 "D"
22 "GIF" 17 1 "D"
23 "GOOGLE" 18 6 "U"
24 "HTML" 18 10 "U"
25 "ICON" 2 7 "U"
26 "INTERNET" 16 1 "D"
27 "JAVASCRIPT" 10 1 "RL"
28 "KERNAL" 3 11 "DDR"
29 "LCD" 1 2 "D"
30 "LOGIN" 17 11 "D"
31 "MEMORY" 4 2 "LR"
32 "MONITOR" 18 11 "DDL"
33 "MOUSE" 11 2 "LR"
34 "NANOSECOND" 2 17 "U"
35 "NETWORK" 16 16 "DUL"
36 "PARTITION" 9 7 "DDR"
37 "PASTE" 6 16 "DUL"
38 "PDF" 4 18 "RL"
39 "PIXEL" 15 1 "RL"
40 "POWERSUPPLY" 1 5 "LR"
41 "PROGRAMMER" 12 16 "DUL"
42 "ROUTER" 10 13 "DDL"
43 "SAVEAS" 10 6 "RL"
44 "SCANNER" 1 17 "U"
45 "SECURITY" 13 10 "U"
46 "SHAREWARE" 14 2 "D"
47 "SOFTWARE" 15 3 "D"
48 "SPAM" 15 11 "DUR"
49 "TASKBAR" 8 3 "RL"
50 "THUMBNAIL" 18 9 "DDL"
51 "UNIX" 12 3 "RL"
52 "WALLPAPER" 11 17 "DUL"
Number of words found: 52