Implementing an example min-max algorithm

In this section, we will be implementing a min-max algorithm (a tic-tac-toe example). So, let's get to NetBeans. We will have an ArrayList, and we will apply randomization and take input. The following are the four classes that we'll be working with:

import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.Scanner;

 

 

 

 

Then, we have to define the x and y points. In a tic-tac-toe game, there are nine tiles, and, on a one-on-one basis with the opponent, the squares are filled, as shown here:

class Point {

    int x, y;

    public Point(int x, int y) {
        this.x = x;
        this.y = y;
    }

    @Override
    public String toString() {
        return "[" + x + ", " + y + "]";
    }
}

class PointAndScore {

    int score;
    Point point;

    PointAndScore(int score, Point point) {
        this.score = score;
        this.point = point;
    }
}

So, we'll define Point, and the x and y points. This will give us...