-
Notifications
You must be signed in to change notification settings - Fork 0
/
BoogleBoard.java
166 lines (141 loc) · 4.88 KB
/
BoogleBoard.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
// author : connor chang
// purpose : a class that represents a board of letters, used in playing boogle
import java.util.*;
public class BoogleBoard {
// class variables
private BoogleLetter[][] board;
private int width, height;
/**
helper function for the constructors, big ugly code to find and assign the adjacent letters
**/
private void assignAdjacents() {
// iterate again, assigning "adjacent" BoogleLetters
for(int x = 0; x < this.width; x++) {
for(int y = 0; y < this.height; y++) {
// finding adjacents for board[x][y]
if(x > 0) {
this.board[x][y].addAdjacent(this.board[x-1][y]);
if(y > 0) {
this.board[x][y].addAdjacent(this.board[x-1][y-1]);
}
}
if(y > 0) {
this.board[x][y].addAdjacent(this.board[x][y-1]);
if(x < this.width - 1) {
this.board[x][y].addAdjacent(this.board[x+1][y-1]);
}
}
if(x < this.width - 1) {
this.board[x][y].addAdjacent(this.board[x+1][y]);
if(y < this.height - 1) {
this.board[x][y].addAdjacent(this.board[x+1][y+1]);
}
}
if(y < this.height - 1) {
this.board[x][y].addAdjacent(this.board[x][y+1]);
if(x > 0) {
this.board[x][y].addAdjacent(this.board[x-1][y+1]);
}
}
}
}
}
/**
by-size constructor
@param width board width
@param height board height
**/
public BoogleBoard(int width, int height) {
this.width = width;
this.height = height;
this.board = new BoogleLetter[this.width][this.height];
// iterate over all board elements, assign each a random letter
int[] adj = new int[8];
for(int x = 0; x < this.width; x++) {
for(int y = 0; y < this.height; y++) {
this.board[x][y] = new BoogleLetter();
}
}
this.assignAdjacents();
}
/**
by-contents constructor
@param board the String 2d array that represents the board
**/
public BoogleBoard(String[][] stringBoard) {
this.width = stringBoard.length;
this.height = stringBoard[0].length;
this.board = new BoogleLetter[this.width][this.height];
// assign letters to the board
for(int x = 0; x < this.width; x++) {
for(int y = 0; y < this.height; y++) {
this.board[x][y] = new BoogleLetter(stringBoard[x][y]);
}
}
this.assignAdjacents();
}
/**
returns a single BoogleLetter from the board at the given index
@param x x-index of the letter
@param y y-index of the letter
**/
public BoogleLetter getLetter(int x, int y) {
return this.board[x][y];
}
/**
helper for validWords that checks for words formed from one given letter
@param currentLetter the BoogleLetter to begin with
@param used the BoogleLetters that have already been used
@param nug the previously collected letter sequence
@param dict the BoogleDict to search through
@param validSet the set to add the valid words to
**/
private void validWordsFromLetter(BoogleLetter currentLetter, HashSet<BoogleLetter> used, String nug, BoogleDict dict, HashSet<String> validSet) {
// make a copy of the used letter set so that used letters in this branch don't show as used in another
HashSet<BoogleLetter> newUsed = new HashSet<BoogleLetter>(used);
// add new letter to nug, if it isn't already used
if(newUsed.contains(currentLetter)) return;
nug += currentLetter.toString();
newUsed.add(currentLetter);
// get words beginning with current word nugget, return if there are none
BoogleDict newDict = dict.wordsBeginningWith(nug);
if(newDict.getLength() == 0) return;
// if the nug occurs exactly in the dict, add it to the set of valid words. either way, continue on to the adjacents
if(newDict.contains(nug)) {
validSet.add(nug);
}
for(int i = 0; i < currentLetter.getDegree(); i++) {
this.validWordsFromLetter(currentLetter.getAdjacent(i), newUsed, nug, newDict, validSet);
}
}
/**
method to calculate all possible words and return them as a Set<String>
@param dict a descending-order-sorted BoogleDict to find words in
**/
public HashSet<String> validWords(BoogleDict dict) {
// make a string HashSet to hold the valid words
HashSet<String> valid = new HashSet<String>();
// iterate through every letter on the board
for(int y = 0; y < this.height; y++) {
for(int x = 0; x < this.width; x++) {
this.validWordsFromLetter(this.board[x][y], new HashSet<BoogleLetter>(), "", dict, valid);
}
}
return valid;
}
/**
toString override, prints the board
**/
@Override
public String toString() {
String result = "";
for(int y = 0; y < this.height; y++) {
for(int x = 0; x < this.width; x++) {
result += this.board[x][y] + " ";
if(this.board[x][y].isOneLetter()) { result += " "; }
}
result += "\n";
}
return result;
}
}