Skip to main content

Tic-Tac-Toe Game Design


Tic - Tac - Toe Game Design

Algorithm:

  1. Take a 2 D Array of size 3X3 initialized to NULL value.
  2. Take position for input. Input should be alter automatically as input taken one by one.
  3. count number of X and O in the Array
  4. if any count of X or O is equal to 3 then go to step 5
  5. check continuity of X or O row-wise, if found go to step 10
  6.  check continuity of X or O column-wise, if found go to step 10
  7. check continuity of X or O in Diagonal or Counter Diagonal wise, if found go to step 10
  8. if total input is less than 9 go to step 2
  9. Conclude:: Totally messed up..... go to Step 11
  10. Display the Owner.....
  11. The End

Program Design (in JAVA):

import java.io.*;

class Game
{
    public static void main (String args[]) throws IOException
    {
        BufferedReader inp=new BufferedReader (new InputStreamReader (System.in));
    int z=0;
    int flag=0;
    int xcount=0, ocount=0;
    char game[][]=new char[3][3];
    char ch;
    int i,j;   
       
       
        // Initialization of game Array
            for(i=0;i<=2;i++)
            {
                for(j=0;j<=2;j++)
                {
                    game[i][j]=' ';
                }
            }

    do{
       
   
       

        // Display Player's Board
            System.out.println(game[0][0]+" | "+game[0][1]+" | "+game[0][2]);
            System.out.println("- + - + -");
            System.out.println(game[1][0]+" | "+game[1][1]+" | "+game[1][2]);
            System.out.println("- + - + -");
            System.out.println(game[2][0]+" | "+game[2][1]+" | "+game[2][2]);
           
        // Take Input
       
        if(z%2==0)
        {
                System.out.println("Position for O:: ");
                ch='O';
        }
        else
        {
            System.out.println("Position for X:: ");
            ch='X';
        }
       
            System.out.println("Input row::");
            int r=Integer.parseInt(inp.readLine ());
            System.out.println("Input column::");
            int c=Integer.parseInt(inp.readLine ());
            if(game[r][c]!=' ')
            {
                z--;
                System.out.println("Don't Cheat!!!");
            }
            else
                game[r][c]=ch;       
           
        // Counting No. of Same input
            xcount=0;
            ocount=0;
            for(i=0;i<=2;i++)
                for(j=0; j<=2; j++)
                {
                    if(game[i][j]=='O')
                        ocount=ocount+1;
                    if(game[i][j]=='X')
                        xcount=xcount+1;
                }
       
            if(xcount>2 || ocount>2)
            {   
               
            // Row-wise checking
                for(i=0;i<=2; i++)   
                {    xcount=0;
                    ocount=0;
                    for(j=0; j<=2; j++)
                    {
                        if(game[i][j]=='O')
                            ocount+=1;
                        if(game[i][j]=='X')
                            xcount+=1;
                    }
                    if(xcount==3)
                    {
                        System.out.println("X has won");
                        flag=1;
                    }
                    if(ocount==3)
                    {
                        System.out.println("O has won");
                        flag=1;
                    }
                    if(flag==1)
                        break;
                }
                   
            // Column-wise checking
                for(i=0;i<=2; i++)   
                {    xcount=0;
                    ocount=0;
                    for(j=0; j<=2; j++)
                    {
                        if(game[j][i]=='O')
                            ocount+=1;
                        if(game[j][i]=='X')
                            xcount+=1;
                    }
                    if(xcount==3)
                    {
                        System.out.println("X has won");
                        flag=1;
                    }
                    if(ocount==3)
                    {
                        System.out.println("O has won");
                        flag=1;
                    }
                        if(flag==1)
                        break;
                }
                   
            // Fwd Diagon checking
                xcount=0;
                ocount=0;
                for(i=0;i<=2; i++)   
                {
                        if(game[i][i]=='O')
                            ocount+=1;
                        if(game[i][i]=='X')
                            xcount+=1;
                }
                    if(xcount==3)
                    {
                        System.out.println("X has won");
                        flag=1;
                    }
                    if(ocount==3)
                    {
                        System.out.println("O has won");
                        flag=1;
                    }
                        if(flag==1)
                        break;
               
                   
            // Rvs Diagon checking
                xcount=0;
                ocount=0;
                for(i=0;i<=2; i++)   
                {
                        if(game[i][2-i]=='O')
                            ocount+=1;
                        if(game[i][2-i]=='X')
                            xcount+=1;
                }
                    if(xcount==3)
                    {
                        System.out.println("X has won");
                        flag=1;
                        break;
                    }
                    if(ocount==3)
                    {
                        System.out.println("O has won");
                        flag=1;
                        break;
                    }   
                       
                }                               
                if(xcount==3 || ocount==3)
                    break;
                z=z+1;
                } while(z<9);
               
                if(flag==0)
                    System.out.println("Sorry !!! None has won!!!");
           

 // Display Player's Board
            System.out.println(game[0][0]+" | "+game[0][1]+" | "+game[0][2]);
            System.out.println("- + - + -");
            System.out.println(game[1][0]+" | "+game[1][1]+" | "+game[1][2]);
            System.out.println("- + - + -");
            System.out.println(game[2][0]+" | "+game[2][1]+" | "+game[2][2]);
                }
            }
   

It is a simple and basic logic design of the game named "Tic-Tac-Toe".
Labels:

Comments

Post a Comment

Popular posts from this blog

2's Complement of 2Byte Number

This program will work out the 2's Complement of a 2 Byte Number. As Microprocessor can perform 8 bits at a time in Accumulator, so we follow the foloowing Algo Fetch the 2 Byte Number in a Register Pair Bring Least Significant Byte of the Number from last Register into A (Accumulator) Make Complement of A and add 1 Store back the Updated LSByte into its source Register Bring MSByte of the Number from another Register into A Make Complement of A and add 1 if carry was genetrated at the time of LSByte opeartion Store back the Updated MSByte into its source Register Store the Result to a Memory location Suppose, Argument Number is stored in Location 1000H and 1001H Memory Location and store the value in 2000H and 2001H Memory Locations. Memory Location Hex Code Label Mnemonics Comment 3050 3051 3052 2A 00 10 START: LHLD 1000H ;Load the HL Register Pair with the content of Memory Location 1000H and 1001H 3053 7D MOV A, L ;Move the Content of L to A ( Accumulator ) 3054 2F
Post a Comment
Read more

Flip-Flop Conversion

Flip-Flop is a memory element. You can say a basic element. It is a circuit that can hold a binary state (0 or 1 as low or high volts) until an input to change that state. We have many flip-flops as SR Flip-Flop (Set Reset) D Flip-Flop (Data) JK Flip-Flop T Flip-Flop (Toggle) Those Flip-Flops are available in market in IC Package Form. Now You have a circuit that uses 1 JK and 1 D Flip-Flop and 3 NOT Gates. So you have to buy three ICs- one for JK, one for D and other for NOT Gate. Ultimately you will see that a flip flop in IC of JK, a flip-flop in D IC and 3 NOT gates are not used. Now, if you convert a JK flip flop into D flip flop then you didn’t have to pay for the D flip flop IC. So, your circuit will be made by 2 ICs in place of 3 and in cheap cost. This article is for that reason. How the Flip-Flops are converted from one to other. Procedure: 1. Write Qt and Qt+1 Table with 4 combination of 0 and 1. 2. Write columns for inputs of destination Flop-Fl op. 3. Write the ce
Post a Comment
Read more

How to set Set-Top Box to Resume automatically to last Channel after switch on?

How to set customised automatic Resume Channel to last viewed in Set-Top Box?  Introduction In the era of Digitally fast growing life WiFi enabled smart devices and also voice controlled smart devices are trying to be companion of every human being. But, all human do not change their habit at the same time. It may be cause of mental attachment or financial limits or unwillingness or though as unnecessary. What ever the reason may be, there exists the old technology, like IR(Infrared), RF(Radio Frequency), etc. So, this article for them who are using "Un-smart" TV like me in this time of Smart World. I was searching for a solution to set my Set-top Box of Videocon DTH (controlled by a RF Remote) to resume the last viewed channel when I power on my TV anytime. Suppose, I was watching NAT-Geo and switch off my (Un-smart) TV, even switch off the plug power at board. Now, after some time / on the next day, when I switch on my TV it will directly tune to the last viewed channel, i.
Post a Comment
Read more