Question

[as points] In the DoninoesGame class, class, write a method get_best move(self, vertical, limit) which write a method get best nove(self, vertical, i which returns a 3-element tuple containing the best move for the current player as a (row, column) tuple, its associated value, and the number of leaf nodes visited during the search. Recall that if the vertical parameter is True, then the current player intends to place a domino on squares (row, col) and (row + 1, col), and if the vertical parameter is False, then the current player intends to place a domino on squares (row, col) and (row, col 1). Moves should be explored row-major order, described in further detail above, to ensure consistency Your search should be a faithful implementation of the alpha-beta search given on page 17o of the course textbook, with the restriction that you should look no further than limit moves into the future. To evaluate a board, you should compute the number of moves available to the current player, then subtract the number of moves available to the opponent. b[False] 3 for i in range(3)] > DominoesGame (b) >E.get best move(True 1) [[False] . 3 for i in range(3)] DominoesGame(b) >>> b .perform_move(, 1, True) .gt best move(False, 1) >>g.get_best_move (True, 2) >g.get_best_move(False, 2)

Answer 1

import java.io.File;

import java.io.FileReader;

public class 8 puzzle program

{

public static void main(String args[])

}

public class Board

{
public Board(int[][] blocks)

public int size()

public int hamming()

public int manhattan()

public boolean isGoal()

public boolean isSolvable()

public boolean equals(Object y)

public Iterable<Board> neighbors()

public String toString()

public static void main(String[] args)
public class Solver

{
public Solver(Board initial)

public int moves()

public Iterable<Board> solution()

public static void main(String[] args)
}

public static void main(String[] args)
{

In in = new In(args[0]);

int N = in.readInt();

int[][] blocks = new int[N][N];

for (int i = 0; i < N; i++)

for (int j = 0; j < N; j++)

blocks[i][j] = in.readInt();

Board initial = new Board(blocks);

if (initial.isSolvable())

{
Solver solver = new Solver(initial);

StdOut.println("Minimum number of moves = " + solver.moves());

for (Board board : solver.solution())

StdOut.println(board);
}

else

{
StdOut.println("Unsolvable puzzle");

}
}