def iterative_dfs(board: [[]]):
"""
"""
# Initializing boardstate
# Checking size
size = len(board)
for i in range(size):
if len(board[i]) != size:
raise Exception("Board matrix is not a square")
# Creating BoardState from a matrix
root_board = BoardState(board)
root_board.generate_islands()
root_board.evaluate()
# IDFS Algorithm
global visited
visited = 0
depth = 0
final_node = None
while final_node == None:
depth += 1
final_node, final_tree = dfs(root_board, depth)
return final_node, depth, final_tree, visited
def a_star(board: [[]]):
"""Function a_star
Searches for a solution using the A* algorithm
args:
board ([[]]): the starting board
returns:
final_node (Tree.Node): the final node of the tree containing the solution
moves_tree (Tree): the whole tree generated in the process
nodes_visited (int): the number of tree nodes visited by the algorithm
"""
# Checking size
size = len(board)
for i in range(size):
if len(board[i]) != size:
raise Exception("Board matrix is not a square")
# Creating BoardState from a matrix
root_board = BoardState(board)
root_board.generate_islands()
root_board.evaluate()
root_board.objective_function = 2 * heuristic.board_cohesion(
root_board) - heuristic.board_mass(root_board)
island_count = len(root_board.islands)
# Initiating Tree
moves_tree = Tree(root_board)
# Initiating stack
to_visit = [moves_tree.root]
nodes_visited = 0
final_node = None
while len(to_visit) > 0:
# Take element from stack
to_visit.sort(key=lambda node: node.content.objective_function,
reverse=True)
node_current = to_visit.pop()
nodes_visited += 1
node_current.content.evaluate()
if node_current.content.solved:
final_node = node_current
return final_node, moves_tree, nodes_visited
# Generate neighbors
board_next = deepcopy(node_current).content
# Making all possible moves
for i in range(island_count):
for j in range(i + 1, island_count):
# If bridge added succesfully, add to tree and stack and copy again
if board_next.add_bridge(i, j):
board_next.objective_function = 2 * heuristic.board_cohesion(
board_next) - heuristic.board_mass(board_next)
child = node_current.add_child(board_next)
to_visit.append(child)
board_next = deepcopy(node_current).content
return final_node, moves_tree, nodes_visited
