int function ( ) { int loc0 = 0 ; for ( int loc1 = 0 ; loc1 < this . size ; loc1 ++ ) { for ( int loc2 = 0 ; loc2 < this . size ; loc2 ++ ) { int loc3 = this . board [ loc1 ] [ loc2 ] + 1 ; for ( int loc4 = 0 ; loc4 < loc1 * this . size + loc2 ; loc4 ++ ) loc3 *= 3 ; loc0 += loc3 ; } } return loc0 ; }
we want to hash identical states into the same bucket . this way , we can use a hashset/map to avoid duplicate states in searches . concode_field_sep TicTacToeState parent concode_elem_sep int size concode_elem_sep boolean turn concode_elem_sep byte[][] board concode_field_sep String identifier concode_elem_sep byte getValue concode_elem_sep float heuristic2 concode_elem_sep boolean equals concode_elem_sep Object clone concode_elem_sep float heuristic concode_elem_sep List<Action> getActions concode_elem_sep String toString concode_elem_sep int compareTo concode_elem_sep Status getStatus concode_elem_sep void executeMove concode_elem_sep State getParentState