A popular diversion in the United States, \u201cword find\u201d (or \u201cword<\/p>\n
search\u201d) puzzles ask the player to find each of a given set of words in a square table filled with single letters. A word can read horizontally (left or right), vertically (up or down), or along a 45 degree diagonal (in any of the four directions) formed by consecutively adjacent cells of the table; it may wrap around the table\u2019s boundaries, but it must read in the same direction with no zigzagging. The same cell of the table may be used in different words, but, in a given word, the same cell may be used no more than once. Write a computer program for solving this puzzle.<\/p>\n
Trying to write it java first and then pseudo code. Need help.<\/p>\n
<\/p>\n
public class WordSearch {<\/p>\n
private static ArrayList board = new ArrayList()<\/p>\n
private static Scanner scanner<\/p>\n
public static void readBoard() {<\/p>\n
while (true) {<\/p>\n
line = input next line<\/p>\n
if (line equals NULL)<\/p>\n
exit from loop<\/p>\n
Delete all spaces in line, convert to Uppercase and add to board } }<\/p>\n
<\/p>\n
public static void printBoard() {<\/p>\n
rows = getRows();<\/p>\n
for (row=0 to rows)<\/p>\n
print board.get(row); }<\/p>\n
public static int getRows() {<\/p>\n
return the number of rows }<\/p>\n
public static int getCols() {<\/p>\n
return the number of columns }<\/p>\n
public static void createScanner() {<\/p>\n
try {<\/p>\n
scanner = new Scanner(new java.io.File(\u201cWordSearchInput.txt\u201d)); }<\/p>\n
catch (Exception e) {<\/p>\n
exit from program } }<\/p>\n
public static void processWords() {<\/p>\n
while (scanner has a next word) {<\/p>\n
word = scanner.next();<\/p>\n
findWord(word); }<\/p>\n
<\/p>\n
public static void findWord(String word) {<\/p>\n
rows = get the number of rows<\/p>\n
cols = get the number of columns<\/p>\n
for (row=0 to rows)<\/p>\n
for (col=0 to cols)<\/p>\n
findWord(word,row,col); }<\/p>\n
public static void findWord(String word, int row, int col) {<\/p>\n
for (drow=-1 to 1)<\/p>\n
for (dcol=-1 to 1)<\/p>\n
findWord(word,row,col,drow,dcol); }<\/p>\n
public static void findWord(String word, int row, int col, int drow, int dcol) {<\/p>\n
rows = get the number of rows<\/p>\n
cols = get the number of columns<\/p>\n
for (offset=0 to word.length) {<\/p>\n
targetRow = row + offset*drow;<\/p>\n
targetCol = col + offset*dcol;<\/p>\n
if ((targetRow is less than 0) OR<\/p>\n
(targetRow is greater than equal to rows) OR<\/p>\n
(targetCol is less than 0) OR<\/p>\n
(targetCol is greater than equal to cols))<\/p>\n
return<\/p>\n
boardChar = board.get(targetRow).charAt(targetCol);<\/p>\n
wordChar = word.charAt(offset);<\/p>\n
if (boardChar not equal to wordChar)<\/p>\n
\/\/ mismatch, so we\u2019re done<\/p>\n
return }<\/p>\n
print (word, row, col, drow, dcol); }<\/p>\n
<\/p>\n
public static void main(String[] args) {<\/p>\n
createScanner();<\/p>\n
readBoard();<\/p>\n
printBoard();<\/p>\n
processWords(); } }<\/p>\n
}<\/p>\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
A popular diversion in the United States, \u201cword find\u201d (or \u201cword search\u201d) puzzles ask the player to find each of a given set of words in a square table filled with single letters. A word can read horizontally (left or right), vertically Read More …<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-75366","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/75366","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/comments?post=75366"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/75366\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=75366"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=75366"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=75366"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}