BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 12, Problem 5PP
Program Plan Intro

  A tic-tac-toe game

Program plan:

  • In the file Combination.java”, create a class Combination”,
    • Declare and initialize necessary variables.
    • Define the constructor to construct a Combination object.
    • Define the method “equals()” to determine if the positions are equal.
    • Define the method “clone()” to clone an object.
    • Define the method “get()” to get the position.
    • Define the method “set()” to set the position.
    • Define the method “getWinner()” to get the winner.
    • Define the method “toString()” to get a string representation of the tictactoe board.
  • In the file Player.java”, create a class Player”,
    • Declare the variable.
    • Define the method “setMarker()” to set the marker.
    • Define the method “getMarker()” to get the marker.
    • Define the method “gameOver()” to determine if the game is over.
    • Define the method “nextMove()” to get the next move.
  • In the file HumanPlayer.java”, create a class HumanPlayer”,
    • Declare the “Scanner” variable.
    • Define the constructor to construct a HumanPlayer object.
    • Define the method “nextMove()” to get the next move.
  • In the file RandomPlayer.java”, import necessary package, and create a class RandomPlayer”,
    • Define the constructor.
    • Define the method “nextMove()” to get the next move.
  • In the file SmartPlayer.java”, create a class SmartPlayer”,
    • Define the constructor.
    • Define the method “nextMove()” to get the next move.
    • Define the method “gameOver()” to determine if game is over.
    • Define the method “isLoser()” to determine if the player is a loser.
  • In the file TicTacToe.java”, create a class TicTacToe”,
    • Declare the variables.
    • Define the constructor.
    • Define the method “play()” to play the game.
    • Define the method “showcombination()” to show the combination of moves.
    • Define the method “markerString()” to mark the board.
  • In the file TicTacToeRunner.java”, import necessary packages, and create a class “TicTacToeRunner”,
    • Define the method “main()”,
    • Create “Scanner” object.
    • Create an object for required classes.
    • Execute for true,
      • Get the input command.
      • If the input command is “P”, play the game.
      • Otherwise, if the input command is “Q”, quit the game.

Blurred answer
Students have asked these similar questions
S A B D FL I C J E G H T K L Figure 1: Search tree 1. Uninformed search algorithms (6 points) Based on the search tree in Figure 1, provide the trace to find a path from the start node S to a goal node T for the following three uninformed search algorithms. When a node has multiple successors, use the left-to-right convention. a. Depth first search (2 points) b. Breadth first search (2 points) c. Iterative deepening search (2 points)
We want to get an idea of how many tickets we have and what our issues are. Print the ticket ID number, ticket description, ticket priority, ticket status, and, if the information is available, employee first name assigned to it for our records. Include all tickets regardless of whether they have been assigned to an employee or not. Sort it alphabetically by ticket status, and then numerically by ticket ID, with the lower ticket IDs on top.
Figure 1 shows an ASM chart representing the operation of a controller. Stateassignments for each state are indicated in square brackets for [Q1, Q0].Using the ASM design technique:(a) Produce a State Transition Table from the ASM Chart in Figure 1.(b) Extract minimised Boolean expressions from your state transition tablefor Q1, Q0, DISPATCH and REJECT. Show all your working.(c) Implement your design using AND/OR/NOT logic gates and risingedgetriggered D-type Flip Flops. Your answer should include a circuitschematic.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education