Instructions and source codes are attached. most of method, class, interfaces are already exists,...

Question

Instructions and source codes are attached. most of method, class, interfaces are already exists, most of works are combining and manipulating existing codes

Microsoft Word - Ultimate Tic.docx ULTIMATE TIC-TAC-TOE (COVID-19) Due: Thursday, November 19, 2020 by the end of the day (No Late Submission Will Be Accepted) There is a very simple solution to keeping Tic-tac-toe fresh and interesting, though, and it has been thought up by a group of mathematicians. It’s being called Ultimate Tic-tac-toe and simply embeds a Tic-tac-toe board in each of the nine squares of the original game. 0 O 1 2 0 O 1 2 0 O 1 2 3 4 5 3 4 X 5 3 4 5 6 7 8 6 7 8 6 7 8 O Board #0 Board #1 Board #2 0 X 1 2 0 O 1 2 0 X 1 2 3 4 5 3 4 O 5 3 4 5 6 7 8 6 7 8 6 7 8 O Board #3 Board #4 Board #5 0 O 1 2 0 X 1 2 0 O 1 2 3 4 5 3 4 O 5 3 4 5 6 7 8 6 7 8 6 7 8 X Board #6 Board #7 Board #8 Now instead of just winning the main board, you also need to win each of the smaller boards first until you have a line of three. NEW RULE: You can only place a mark on the board determined by the position of your opponent’s last placed mark. So, if they put an X or O in the top right corner of a square, your next move must occur in the top right board. By adding that rule the game is no longer about winning a single board, it’s about tactically managing up to 9 games at once and plotting ahead. You still win by marking three squares in a row, but that now involves winning three games. THE EFFECTS OF THE NEW RULE: 1- Your opponent can force you to choose an open square in an already won/tie board. 1- Player X Move: - Board# : 0 - Square#: 1 2- Player O Move: Only valid Board is Board #1 - Square#: 5 3- Player X Move: Only valid Board is Board #5 - Square#: 6 4- Player O Move: Only valid Board is Board #6 - Square#: 4 For example, after a while Board # 0 has a winner, Player O. It is the Player X turn and the only valid Board# for Player X is Board#0 Player X Move: Only valid Board is Board #0 - Square#: 6 0 O 1 X 2 0 1 2 0 1 2 3 4 O 5 3 4 5 O 3 4 5 6 X 7 8 O 6 7 8 6 7 8 Board #0 Board #1 Board #2 0 1 2 0 1 2 0 1 2 3 4 5 3 4 5 3 4 5 6 7 8 6 7 8 6 X 7 8 Board #3 Board #4 Board #5 0 1 2 0 1 2 0 1 2 3 4 O 5 3 4 5 3 4 5 6 7 8 6 7 8 6 7 8 Board #6 Board #7 Board #8 2- If the board is already full, you get a free pass to place your mark in any board For example, after a while Board # 0 is completely full. It is the Player X turn and the only valid Board# for Player X is Board#0. Since Board#0 is full, then the Player X gets to pick any other Board. Player X Move: - Board# : 8 - Square#: 8 0 O 1 X 2 X 0 1 2 0 1 2 3 X 4 O 5 X 3 4 5 O 3 4 5 6 O 7 X 8 O 6 7 8 6 7 8 Board #0 Board #1 Board #2 0 1 2 0 1 2 0 1 2 3 4 5 3 4 5 3 4 5 6 7 8 6 7 8 6 X 7 8 Board #3 Board #4 Board #5 0 1 2 0 1 2 0 1 2 3 4 O 5 3 4 5 3 4 5 6 7 8 6 7 8 6 7 8 X Board #6 Board #7 Board #8 The great thing about this rule change and board layout is it remains easy to understand. BASIC RULES: 1. Each turn, you mark one of the small squares. 2. When you get three in a row on a small board, you’ve won that board. 3. To win the game, you need to win three small boards in a row. 4. You don’t get to pick which of the nine boards to play on. That’s determined by your opponent’s previous move. Whichever square he picks, that’s the board you must play in next. (And whichever square you pick will determine which board he plays on next.) A FEW CLARIFYING RULES ARE NECESSARY: 1. What if my opponent sends me to a board that’s already been won/tie but not full? In that case, you get to play on that board, but your move doesn’t affect the outcome of that board. 2. What if my opponent sends me to a board that’s already been full? In that case, congratulations – you get to go anywhere you like, on any of the other boards. WHAT/HOW/WHERE/WHEN TO SUBMIT: • Draw a UML class diagram (manual diagram also acceptable). o Identify classes and the relation between them (for example inheritance or aggregation) o Submit your diagram as a PDF file. o Convert your class diagram to software classes. o Your class diagram should reflect your code • Review the Grading criteria and the project rubric in the eLearning o The project is an individual project. o Copying, in whole or in part, from other sources will be considered an act of scholastic dishonesty. • The Project Due on Nov 19, 2020 (by the end of the day) o No Late Submission Will Be Accepted. • The project must be turned in via eLearning ONLY. Please: o Zip all the source codes (.java) in a zip file. All the Java source code necessary to compile and execute your code. o Include a comment section at the beginning of your code with your name, section number, and describe Your Analysis, Design and Test. o A readme file, documenting what you have and/or have not done, describing specific details that you feel we need to know when grading your work. o A video of your running code (to show that, it is working) o No E-Mail Submissions Are Accepted. • This is a command Line game. No GUI. DIFFERENT VERSION OF THE GAME 1. Player versus AI (Mandatory) 2. Program provides a list of possible legal moves to each player. (Optional – extra 5 points) 3. Player versus smart AI* (Optional – extra 5 points) *smart AI will always select the best move to win the game. SAMPLE RUNS: • Payer X is the winner x-winner.txt • Player O is the winner o-winner.txt • no-winner.txt REFERENCES: § Https://mathwithbaddrawings.com/ultimate-tic-tac-toe-original-post/ § https://www.geek.com/games/tic-tac-toe-made-much-more-interesting-with-a-simple- tweak-1559289/ § https://mathwithbaddrawings.com/2013/11/18/tic-tac-toe-puzzles-and-the-difference- between-a-puzzle-and-a-game/ Microsoft Word - Ultimate Tic.docx ULTIMATE TIC-TAC-TOE (COVID-19) Due: Thursday, November 19, 2020 by the end of the day (No Late Submission Will Be Accepted) There is a very simple solution to keeping Tic-tac-toe fresh and interesting, though, and it has been thought up by a group of mathematicians. It’s being called Ultimate Tic-tac-toe and simply embeds a Tic-tac-toe board in each of the nine squares of the original game. 0 O 1 2 0 O 1 2 0 O 1 2 3 4 5 3 4 X 5 3 4 5 6 7 8 6 7 8 6 7 8 O Board #0 Board #1 Board #2 0 X 1 2 0 O 1 2 0 X 1 2 3 4 5 3 4 O 5 3 4 5 6 7 8 6 7 8 6 7 8 O Board #3 Board #4 Board #5 0 O 1 2 0 X 1 2 0 O 1 2 3 4 5 3 4 O 5 3 4 5 6 7 8 6 7 8 6 7 8 X Board #6 Board #7 Board #8 Now instead of just winning the main board, you also need to win each of the smaller boards first until you have a line of three. NEW RULE: You can only place a mark on the board determined by the position of your opponent’s last placed mark. So, if they put an X or O in the top right corner of a square, your next move must occur in the top right board. By adding that rule the game is no longer about winning a single board, it’s about tactically managing up to 9 games at once and plotting ahead. You still win by marking three squares in a row, but that now involves winning three games. THE EFFECTS OF THE NEW RULE: 1- Your opponent can force you to choose an open square in an already won/tie board. 1- Player X Move: - Board# : 0 - Square#: 1 2- Player O Move: Only valid Board is Board #1 - Square#: 5 3- Player X Move: Only valid Board is Board

ultimate-tictactoe-covid-191-uznq5p5v.pdf tttgame-xwltrgc5.zip downloads-u510zyub-bxnmy0zv.zip ultimate-tictactoe-covid-191-2bcpntn1-g5ypy0z4.pdf

Sandeep Kumar · Accepted Answer

game-ultimate-tictactoe-master/.gitignore
/target/
/.classpath
/.project
/.settings/
game-ultimate-tictactoe-master/README.md
# game-ultimate-tictactoe
Game created using the [CodinGame SDK](https://www.codingame.com/playgrounds/25775).
[Play here on CodinGame](https://www.codingame.com/ide/puzzle/tic-tac-toe)
game-ultimate-tictactoe-master/config/Boss.java
game-ultimate-tictactoe-master/config/Boss.java
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.Scanner;
class Player {
    static class Action {
        int row, col;
        public Action(int row, int col) {
            this.row = row;
            this.col = col;
        }
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Random random = new Random(0);
        while (true) {
            int opponentRow = in.nextInt();
            int opponentCol = in.nextInt();
            int validActionCount = in.nextInt();
            List actions = new ArrayList(validActionCount);
            for (int i = 0; i -?[0-9]{1})\s+(?-?[0-9]{1})?(?:\s+(?.+))?");
    public Action getAction() throws TimeoutException, InvalidAction {
        try {
            String playerAction = getOutputs().get(0);
            Matcher match = PLAYER_ACTION_PATTERN.matcher(playerAction);
            if (match.matches()) {
                String msg = match.group("message");
                if (msg == null) message.setText(" ");
                else if (msg.length()  gameManager;
    @Inject private GraphicEntityModule graphicEntityModule;
    private TicTacToeGrid masterGrid;
    private TicTacToeGrid[][] smallGrids;
    private Action lastAction = null;
    private List validActions;
    private Random random;
    
    @Override
    public void init() {
        random = new Random(gameManager.getSeed());
        drawBackground();
        drawHud();
        drawGrids();
        gameManager.setFrameDuration(600);
        if (gameManager.getLeagueLevel() == 1) {
            gameManager.setMaxTurns(9);
        } else {
            gameManager.setMaxTurns(9 * 9);
        }
        
        validActions = getValidActions();
    }
    private void drawBackground() {
        graphicEntityModule.createSprite()
                .setImage("Background.jpg")
                .setAnchor(0);
        graphicEntityModule.createSprite()
                .setImage("logo.png")
                .setX(280)
                .setY(915)
                .setBaseWidth(285)
                .setBaseHeight(37)
                .setAnchor(0.5);
        graphicEntityModule.createSprite()
                .setImage("logoCG.png")
                .setX(1920 - 280)
                .setY(915)
                .setAnchor(0.5);
    }
    private void drawGrids() {
        int bigCellSize = 240;
        int bigCellBorderWidth = 20;
        int bigCenterX = (int) Math.round(1920 / 2);
        int bigCenterY = (int) Math.round(1080 / 2);
        masterGrid = new TicTacToeGrid(graphicEntityModule);
        masterGrid.draw("big_board.png", bigCenterX, bigCenterY, bigCellSize, bigCellBorderWidth);
        if (gameManager.getLeagueLevel() == 2) {
            smallGrids = new TicTacToeGrid[3][3];
            
            for (int i = -1; i  validActions) {
        // last action
        if (lastAction != null) {
            player.sendInputLine(lastAction.toString());
        } else {
            player.sendInputLine("-1 -1");
        }
        // valid actions
        player.sendInputLine(Integer.toString(validActions.size()));
        for (Action action : validActions) {
            player.sendInputLine(action.toString());    
        }
    }
    private void setWinner(Player player) {
        gameManager.addToGameSummary(GameManager.formatSuccessMessage(player.getNicknameToken() + " won!"));
        player.setScore(10);
        endGame();
    }
    private List getValidActions() {
        List validActions;
        if (gameManager.getLeagueLevel() == 1) {
            validActions = masterGrid.getValidActions();
        } else {
            validActions = new ArrayList();
            for (int row = 0; row  0) {
                    setWinner(player);
                }
            } else {
                grid = smallGrids[action.row / 3][action.col / 3];
                if (grid.play(new Action(action.player, action.row % 3, action.col % 3)) > 0) {
                    player.setScore(player.getScore() + 1);
                    gameManager.addTooltip(player, player.getNicknameToken() + " has won one cell");
                    grid.hide();
                    if (masterGrid.play(new Action(action.player, action.row / 3, action.col / 3)) > 0) {
                        setWinner(player);
                    }
                }
            }
            validActions = getValidActions();
            if (validActions.isEmpty()) {
                endGame();
            }
        } catch (TimeoutException e) {
            gameManager.addToGameSummary(GameManager.formatErrorMessage(player.getNicknameToken() + " timeout!"));
            player.deactivate(player.getNicknameToken() + " timeout!");
            player.setScore(-1);
            endGame();
        } catch (InvalidAction e) {
            gameManager.addToGameSummary(GameManager.formatErrorMessage(player.getNicknameToken() + " eliminated: " + e.getMessage()));
            player.deactivate(e.getMessage());
            player.setScore(-1);
            endGame();
        }
    }
    private void endGame() {
        gameManager.endGame();
        Player p0 = gameManager.getPlayers().get(0);
        Player p1 = gameManager.getPlayers().get(1);
        if (p0.getScore() > p1.getScore()) {
            p1.hud.setAlpha(0.3);
        }
        if (p0.getScore()  getValidActions() {
        List validActions = new ArrayList();
        if (winner == 0) {
            for (int x = 0; x = 3 || action.col = 3 || grid[action.row][action.col] != 0) {
            throw new InvalidAction("Invalid move!");
        }
        // update grid
        grid[action.row][action.col] = action.player.getIndex() + 1;
        winner = checkWinner();
        return winner;
    }
    private int checkWinner() {
        for (int i = 0; i  0 && grid[i][0] == grid[i][1] && grid[i][0] == grid[i][2]) {
                return grid[i][0];
            }
            // check cols
            if (grid[0][i] > 0 && grid[0][i] == grid[1][i] && grid[0][i] == grid[2][i]) {
                return grid[0][i];
            }
        }
        // check diags
        if (grid[0][0] > 0 && grid[0][0] == grid[1][1] && grid[0][0] == grid[2][2]) {
            return grid[0][0];
        }
        if (grid[2][0] > 0 && grid[2][0] == grid[1][1] && grid[2][0] == grid[0][2]) {
            return grid[2][0];
        }
        return 0;
    }
}
game-ultimate-tictactoe-master/src/main/java/com/codingame/game/TicTacToeGrid.java
game-ultimate-tictactoe-master/src/main/java/com/codingame/game/TicTacToeGrid.java
package com.codingame.game;
import com.codingame.gameengine.module.entities.Curve;
import com.codingame.gameengine.module.entities.GraphicEntityModule;
import com.codingame.gameengine.module.entities.Group;
import com.codingame.gameengine.module.entities.Sprite;
public class TicTacToeGrid extends TicTacToe {
    enum State {
        ACTIVE, INACTIVE
    }
    private String[] images = { "cross.png", "circle.png" };
    private Group entity;
    private int centerX;
    private int centerY;
    private int cellSize;
    private int lineWidth;
    private State state;
    private State prevState;
    
    private GraphicEntityModule graphicEntityModule;
    public TicTacToeGrid(GraphicEntityModule graphicEntityModule) {
        this.graphicEntityModule = graphicEntityModule;
        state = State.ACTIVE;
        prevState = State.ACTIVE;
    }
    public void draw(String image, int centerX, int centerY, int cellSize, int lineWidth) {
        this.centerX = centerX;
        this.centerY = centerY;
        this.cellSize = cellSize;
        this.lineWidth = lineWidth;
        this.entity = graphicEntityModule.createGroup();
        Sprite sprite = graphicEntityModule
                .createSprite()
                .setImage(image)
                .setAnchorX(0.5)
                .setAnchorY(0.5)
                .setX(centerX)
                .setY(centerY);
        entity.add(sprite);
    }
    @Override
    public int play(Action action) throws InvalidAction {
        int winner = super.play(action);
        drawPlay(action);
        return winner;
    }
    public void drawPlay(Action action) {
        Sprite symbol = graphicEntityModule.createSprite()
                .setX(convert(centerX, action.col - 1))
                .setY(convert(centerY, action.row - 1))
                .setImage(images[action.player.getIndex()])
                .setBaseWidth((int) (0.8 * cellSize))
                .setBaseHeight((int) (0.8 * cellSize))
                .setTint(action.player.getColorToken())
                .setAnchor(0.5);
        // Animate arrival
        symbol.setScale(0);
        graphicEntityModule.commitEntityState(0.1, symbol);
        symbol.setScale(1, Curve.ELASTIC);
        graphicEntityModule.commitEntityState(0.9, symbol);
        this.entity.add(symbol);
    }
    private int convert(int orig, double unit) {
        return (int) (orig + unit * (cellSize + lineWidth));
    }
    public void hide() {
        this.entity.setVisible(false);
        graphicEntityModule.commitEntityState(0, entity);
    }
    public void activate() {
        state = State.ACTIVE;
    }
    public void deactivate() {
        state = State.INACTIVE;
    }
    public void animate() {
        if (state != prevState) {
            if (state == State.INACTIVE) {
                this.entity.setAlpha(0.5, Curve.NONE);
                graphicEntityModule.commitEntityState(0.9, entity);
            } else {
                this.entity.setAlpha(1, Curve.NONE);
                graphicEntityModule.commitEntityState(0.9, entity);
            }
            prevState = state;

Microsoft Word - Ultimate Tic.docx ULTIMATE TIC-TAC-TOE (COVID-19) Due: Thursday, November 19, 2020 by the end of the day (No Late Submission Will Be Accepted) There is a very simple solution to...

Answer To: Microsoft Word - Ultimate Tic.docx ULTIMATE TIC-TAC-TOE (COVID-19) Due: Thursday, November 19, 2020...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment