├── .classpath
├── .gitignore
├── .project
├── README.md
└── src
    ├── Dictionary.java
    └── WordHue.java


/.classpath:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <classpath>
3 | 	<classpathentry kind="src" path="src"/>
4 | 	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
5 | 	<classpathentry kind="output" path="bin"/>
6 | </classpath>
7 | 


--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
 1 | # Mac OS 
 2 | .DS_Store
 3 | 
 4 | 
 5 | *.class
 6 | 
 7 | # Mobile Tools for Java (J2ME)
 8 | .mtj.tmp/
 9 | 
10 | # Package Files #
11 | *.jar
12 | *.war
13 | *.ear
14 | 
15 | # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
16 | hs_err_pid*
17 | /bin/
18 | 


--------------------------------------------------------------------------------
/.project:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <projectDescription>
 3 | 	<name>WordHue</name>
 4 | 	<comment></comment>
 5 | 	<projects>
 6 | 	</projects>
 7 | 	<buildSpec>
 8 | 		<buildCommand>
 9 | 			<name>org.eclipse.jdt.core.javabuilder</name>
10 | 			<arguments>
11 | 			</arguments>
12 | 		</buildCommand>
13 | 	</buildSpec>
14 | 	<natures>
15 | 		<nature>org.eclipse.jdt.core.javanature</nature>
16 | 	</natures>
17 | </projectDescription>
18 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # WordHue
 2 | ## Description
 3 | This project is for a word game named "WordHue" on ios and I write a program to solve it.
 4 | 
 5 | The solution could be improved by discarding the string that is not a prefix of a valid word. The computing complexity is too high for a board of 5x5 while the time of 4x4 is fine. In practice I did search on 4 board of 4x4 instead of a board of 5x5. It works and I got the highest score :) Have fun.
 6 | 
 7 | ## Reference
 8 | - [How to check if a string is an valid english word](http://stackoverflow.com/questions/11607270/how-to-check-whether-given-string-is-a-word) by Mr BullyWiiPlaza.
 9 | 
10 | - Note that the dictionary I borrowed is from [dwyl](https://github.com/dwyl/english-words/blob/master/words.txt).
11 | 


--------------------------------------------------------------------------------
/src/Dictionary.java:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * 
 3 |  */
 4 | 
 5 | /**
 6 |  * @author dc
 7 |  *
 8 |  */
 9 | import java.io.IOException;
10 | import java.nio.file.Files;
11 | import java.nio.file.Path;
12 | import java.nio.file.Paths;
13 | import java.util.Collections;
14 | import java.util.HashSet;
15 | import java.util.Set;
16 | 
17 | public class Dictionary
18 | {
19 |     private Set<String> wordsSet;
20 | 
21 |     public Dictionary() throws IOException
22 |     {
23 |         Path path = Paths.get("words.txt");
24 |         byte[] readBytes = Files.readAllBytes(path);
25 |         String wordListContents = new String(readBytes, "UTF-8");
26 |         String[] words = wordListContents.split("\n");
27 |         wordsSet = new HashSet<>();
28 |         Collections.addAll(wordsSet, words);
29 |     }
30 | 
31 |     public boolean contains(String word)
32 |     {
33 |         return wordsSet.contains(word);
34 |     }
35 | }


--------------------------------------------------------------------------------
/src/WordHue.java:
--------------------------------------------------------------------------------
  1 | /**
  2 |  * 
  3 |  */
  4 | 
  5 | /**
  6 |  * @author dc
  7 |  *
  8 |  */
  9 | 
 10 | import java.util.Scanner;
 11 | /*
 12 | import java.io.BufferedReader;
 13 | import java.io.FileReader;
 14 | import java.io.IOException;
 15 | */
 16 | import java.io.IOException;
 17 | import java.nio.file.Files;
 18 | import java.nio.file.Path;
 19 | import java.nio.file.Paths;
 20 | import java.util.Collections;
 21 | import java.util.HashSet;
 22 | import java.util.Set;
 23 | 
 24 | 
 25 | public class WordHue {
 26 | 	private static Set<String> wordsSet;
 27 | 
 28 | 	/**
 29 | 	 * @param args
 30 | 	 * check_for_word(String word) is copied from:
 31 | 	 * http://stackoverflow.com/questions/11607270/how-to-check-whether-given-string-is-a-word
 32 | 	 */
 33 | 
 34 | /*    public static boolean check_for_word(String word) {
 35 |         // System.out.println(word);
 36 |         try {
 37 |             BufferedReader in = new BufferedReader(new FileReader(
 38 |                     "/usr/share/dict/web2"));
 39 |             String str;
 40 |             while ((str = in.readLine()) != null) {
 41 |                 if ( str.contains(word) ) {
 42 |                     return true;
 43 |                 }
 44 |                 else{
 45 |                 	return false;
 46 |                 }
 47 |             }
 48 |             in.close();
 49 |         } catch (IOException e) {
 50 |         }
 51 | 
 52 |         return false;
 53 |     }*/
 54 |     
 55 |     public static void search_for_word(int length, int width, 
 56 |     		char[][] board, char[][] visited,
 57 |     		int startX, int startY, String wordStr){
 58 |     	//get a copy of the current visited
 59 |     	char[][] visited_XY = new char[width][length];
 60 |     	int i,j;
 61 |     	for(i=0; i<width; i++){
 62 |     		for(j=0; j<length; j++){
 63 |     			visited_XY[i][j] = visited[i][j];
 64 |     		}
 65 |     	}
 66 |     	//then revise it
 67 |     	String wordStr_addXY = wordStr + board[startX][startY];
 68 |     	visited_XY[startX][startY] = 1;
 69 |     	//check if it is a word
 70 |     	//System.out.println("Checking \"+" + wordStr_addXY + "\"");
 71 |     	if( wordsSet.contains(wordStr_addXY) ){
 72 | 			if(wordStr_addXY.length() > 4) 
 73 | 				System.out.println("A word has been found: " + wordStr_addXY);
 74 | 		}
 75 |     	
 76 |     	//continue recursive search
 77 |     	//left_above
 78 | 		if(startX-1>=0 && startX-1<width && startY-1>=0 && startY-1<length && 
 79 | 				visited_XY[startX-1][startY-1] == 0){
 80 | 			search_for_word(length,width,board, visited_XY, startX-1, startY-1, wordStr_addXY);
 81 | 		}
 82 |     	//above
 83 | 		if(startX-1>=0 && startX-1<width && startY>=0 && startY<length && 
 84 | 				visited_XY[startX-1][startY] == 0){
 85 | 			search_for_word(length,width,board, visited_XY, startX-1, startY, wordStr_addXY);
 86 | 		}
 87 |     	//right_above
 88 | 		if(startX-1>=0 && startX-1<width && startY+1>=0 && startY+1<length && 
 89 | 				visited_XY[startX-1][startY+1] == 0){
 90 | 			search_for_word(length,width,board, visited_XY, startX-1, startY+1, wordStr_addXY);
 91 | 		}
 92 |     	//left
 93 | 		if(startX>=0 && startX<width && startY-1>=0 && startY-1<length && 
 94 | 				visited_XY[startX][startY-1] == 0){
 95 | 			search_for_word(length,width,board, visited_XY, startX, startY-1, wordStr_addXY);
 96 | 		}
 97 |     	//right
 98 | 		if(startX>=0 && startX<width && startY+1>=0 && startY+1<length && 
 99 | 				visited_XY[startX][startY+1] == 0){
100 | 			search_for_word(length,width,board, visited_XY, startX, startY+1, wordStr_addXY);
101 | 		}
102 |     	//left_beneath
103 | 		if(startX+1>=0 && startX+1<width && startY-1>=0 && startY-1<length && 
104 | 				visited_XY[startX+1][startY-1] == 0){
105 | 			search_for_word(length,width,board, visited_XY, startX+1, startY-1, wordStr_addXY);
106 | 		}
107 |     	//beneath
108 | 		if(startX+1>=0 && startX+1<width && startY>=0 && startY<length && 
109 | 				visited_XY[startX+1][startY] == 0){
110 | 			search_for_word(length,width,board, visited_XY, startX+1, startY, wordStr_addXY);
111 | 		}
112 |     	//right_beneath
113 | 		if(startX+1>=0 && startX+1<width && startY+1>=0 && startY+1<length && 
114 | 				visited_XY[startX+1][startY+1] == 0){
115 | 			search_for_word(length,width,board, visited_XY, startX+1, startY+1, wordStr_addXY);
116 | 		}
117 | 
118 | 		
119 |     }
120 | 
121 |     public static void main(String[] args) {
122 |     	//get the local dictionary
123 | 
124 |         Path path = Paths.get("/Users/dc/Documents/OneDrive/GitPlace/WordHue/src/words3.txt");
125 |         try{
126 |         	byte[] readBytes = Files.readAllBytes(path);
127 |             //System.out.println("Come Here");
128 | 
129 |             String wordListContents = new String(readBytes, "UTF-8");
130 |             String[] words = wordListContents.split("\n");
131 |             wordsSet = new HashSet<>();
132 |             Collections.addAll(wordsSet, words);
133 |         } catch(IOException e){
134 |         	System.out.println(e);
135 |         }
136 |     	
137 |         //get the size of the board
138 |     	System.out.println("Please give the length and width of the WordHue board");
139 |     	Scanner in = new Scanner(System.in);
140 |     	int length = in.nextInt();
141 |     	int width = in.nextInt();
142 |     	
143 |     	//read the WordHue board
144 |     	System.out.println("Please give the WordHue board");
145 |     	char[][] board = new char[width][length];
146 |     	int i=0, j=0;
147 |     	for(i=0; i<width; i++){
148 |     		for(j=0; j<length; j++){
149 |     			board[i][j] = in.next().charAt(0);
150 |     		}
151 |     	}
152 |     	in.close();
153 |     	
154 |     	//search the board for the top 10 longest word.
155 |     	char[][] visited = new char[width][length];
156 |     	for(i=0; i<width; i++){
157 |     		for(j=0; j<length; j++){
158 |     			visited[i][j]=0;
159 |     		}
160 |     	}
161 |     	//
162 |     	for(i=0; i<width; i++){
163 |     		for(j=0; j<length; j++){
164 |     			search_for_word(length, width, board, visited,
165 |     					i, j, "");
166 |     		}
167 |     	}
168 |         //System.out.println(wordsSet.contains("orld"));
169 |     	System.out.println("All Above!");
170 |     }
171 | 
172 | }
173 | 


--------------------------------------------------------------------------------