Tic Tac Toe (Game) Java project.

PHOTO

Mon Mar 27 2023 21:19:11 GMT+0000 (Coordinated Universal Time)

Saved by @Mohamedshariif #java

import java.awt.*;
import java.awt.event.*;
import java.util.*;
import javax.swing.*;

//Main method make different main.
public class Main {

	public static void main(String[] args) {
		
		TicTacToe tictactoe = new TicTacToe();
		
	}

}
// make different class.

public class TicTacToe implements ActionListener {
	
	Random random = new Random();
	JFrame frame = new JFrame();
	JPanel title_panel = new JPanel();
	JPanel button_panel = new JPanel();
	JLabel textfield = new JLabel();
	JButton[] buttons = new JButton[9];
	boolean player1_turn;
	
	
	TicTacToe() {
		frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.setSize(800,800);
        frame.getContentPane().setBackground(new Color(50,50,100));
        frame.setLayout(new BorderLayout());
        frame.setVisible(true);
        
        textfield.setBackground(new Color(50,50,100));
        textfield.setForeground(new Color(25,255,0));
        textfield.setFont(new Font("Ink Free", Font.BOLD,75));
        textfield.setHorizontalAlignment(JLabel.CENTER);
        textfield.setText("Tic-Tac-Toe");
        textfield.setOpaque(true);
        
        title_panel.setLayout(new BorderLayout());
        title_panel.setBounds(0,0,800,100);
        
        button_panel.setLayout(new GridLayout(3,3));
        button_panel.setBackground(new Color(150,150,150));
        
        for(int i=0;i<9;i++)
        {
            buttons[i] = new JButton();
            button_panel.add(buttons[i]);
            buttons[i].setFont(new Font("MV Boli",Font.BOLD,120));
            buttons[i].setFocusable(false);
            buttons[i].addActionListener(this);
            
        }

        
        title_panel.add(textfield);
        frame.add(title_panel,BorderLayout.NORTH);
        frame.add(button_panel);
       
        firstTurn();
        
	}
	
	
	 @Override
	 public void actionPerformed(ActionEvent e) {
		 
		 for(int i=0;i<9;i++) {
	            if(e.getSource()==buttons[i]) {
	            	if(player1_turn) {
	                    if(buttons[i].getText()=="") {
	                        buttons[i].setForeground(new Color(255,0,0));
	                        buttons[i].setText("X");
	                        player1_turn=false;
	                        textfield.setText("O turn");
	                        check();
	                    }
	                }
	                else {
	                    if(buttons[i].getText()=="") {
	                        buttons[i].setForeground(new Color(0,0,255));
	                        buttons[i].setText("O");
	                        player1_turn=true;
	                        textfield.setText("X turn");
	                        check();
	                    }
	                }
	            }
	        }
	 }
	 
	 public void firstTurn() {
		 
		 try {
			Thread.sleep(2000);
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		 
		 if(random.nextInt(2)==0) {
			 player1_turn=true;
			 textfield.setText("X turn");
	            
	        }
	        else {
	            player1_turn=false;
	            textfield.setText("O turn");
	        }
		 
	 }
	 
	 public void check() {
		 
		 //check X win conditions
		 if(
				 (buttons[0].getText()=="X") &&
				 (buttons[1].getText()=="X") &&
				 (buttons[2].getText()=="X")
				 ) {
			 xWins(0,1,2);
		 }
		 if(
				 (buttons[3].getText()=="X") &&
				 (buttons[4].getText()=="X") &&
				 (buttons[5].getText()=="X")
				 ) {
			 xWins(3,4,5);
		 }
		 if(
				 (buttons[6].getText()=="X") &&
				 (buttons[7].getText()=="X") &&
				 (buttons[8].getText()=="X")
				 ) {
			 xWins(6,7,8);
		 }
		 if(
				 (buttons[0].getText()=="X") &&
				 (buttons[3].getText()=="X") &&
				 (buttons[6].getText()=="X")
				 ) {
			 xWins(0,3,6);
		 }
		 if(
				 (buttons[1].getText()=="X") &&
				 (buttons[4].getText()=="X") &&
				 (buttons[7].getText()=="X")
				 ) {
			 xWins(1,4,7);
		 }
		 if(
				 (buttons[2].getText()=="X") &&
				 (buttons[5].getText()=="X") &&
				 (buttons[8].getText()=="X")
				 ) {
			 xWins(2,5,8);
		 }
		 if(
				 (buttons[0].getText()=="X") &&
				 (buttons[4].getText()=="X") &&
				 (buttons[8].getText()=="X")
				 ) {
			 xWins(0,4,8);
		 }
		 if(
				 (buttons[2].getText()=="X") &&
				 (buttons[4].getText()=="X") &&
				 (buttons[6].getText()=="X")
				 ) {
			 xWins(2,4,6);
		 }
		 
		 
		 //check O win conditions
		 if(
				 (buttons[0].getText()=="O") &&
				 (buttons[1].getText()=="O") &&
				 (buttons[2].getText()=="O")
				 ) {
			 oWins(0,1,2);
		 }
		 if(
				 (buttons[3].getText()=="O") &&
				 (buttons[4].getText()=="O") &&
				 (buttons[5].getText()=="O")
				 ) {
			 oWins(3,4,5);
		 }
		 if(
				 (buttons[6].getText()=="O") &&
				 (buttons[7].getText()=="O") &&
				 (buttons[8].getText()=="O")
				 ) {
			 oWins(6,7,8);
		 }
		 if(
				 (buttons[0].getText()=="O") &&
				 (buttons[3].getText()=="O") &&
				 (buttons[6].getText()=="O")
				 ) {
			 oWins(0,3,6);
		 }
		 if(
				 (buttons[1].getText()=="O") &&
				 (buttons[4].getText()=="O") &&
				 (buttons[7].getText()=="O")
				 ) {
			 oWins(1,4,7);
		 }
		 if(
				 (buttons[2].getText()=="O") &&
				 (buttons[5].getText()=="O") &&
				 (buttons[8].getText()=="O")
				 ) {
			 oWins(2,5,8);
		 }
		 if(
				 (buttons[0].getText()=="O") &&
				 (buttons[4].getText()=="O") &&
				 (buttons[8].getText()=="O")
				 ) {
			 oWins(0,4,8);
		 }
		 if(
				 (buttons[2].getText()=="O") &&
				 (buttons[4].getText()=="O") &&
				 (buttons[6].getText()=="O")
				 ) {
			 oWins(2,4,6);
		 }
		 
	 }
	 
	 public void xWins(int a, int b, int c) {
		 
		 buttons[a].setBackground(Color.GREEN);
	     buttons[b].setBackground(Color.GREEN);
	     buttons[c].setBackground(Color.GREEN);
	        
	     for(int i=0;i<9;i++) {
	    	 buttons[i].setEnabled(false);
	    	 }
	        textfield.setText("X wins");
	    }
		 
	 public void oWins(int a, int b, int c) {
		 
		 buttons[a].setBackground(Color.GREEN);
	     buttons[b].setBackground(Color.GREEN);
	     buttons[c].setBackground(Color.GREEN);
	        
	     for(int i=0;i<9;i++) {
	    	 buttons[i].setEnabled(false);
	    	 }
	        textfield.setText("O wins");
	    }
		 
		 
	 }

Save snippets that work from anywhere online with our extensions

Available in the Chrome Web Store

Get Firefox Add-on

Get VS Code extension

Comments

More like this

Tic Tac Toe (Game)

@Mohamedshariif

Tic Tac Toe (Game) Java project.

#java #howto #interviewquestions #mobile

How to use Java Swing to create a button

import javax.swing.*;  
public class FirstSwingExample {  
public static void main(String[] args) {  
JFrame f=new JFrame();//creating instance of JFrame  
          
JButton b=new JButton("click");//creating instance of JButton  
b.setBounds(130,100,100, 40);//x axis, y axis, width, height  
          
f.add(b);//adding button in JFrame  
          
f.setSize(400,500);//400 width and 500 height  
f.setLayout(null);//using no layout managers  
f.setVisible(true);//making the frame visible  
}  
}

#java #java #arraylists #while-loops #equala

How to insert ArrayList into While-condition?

List<String> songList = new ArrayList<>();
songList.add("Some song"); //Repeat until satisfied

System.out.println("\n\tWelcome! Please choose a song!");
String songChoice = scan.nextLine();
while (!songList.contains(songChoice)) {
    //Do stuff when input is not a recognised song
}

Print Nested Array in Java

String[][] deepArray = new String[][] {{"John", "Mary"}, {"Alice", "Bob"}};
System.out.println(Arrays.toString(deepArray));
//output: [[Ljava.lang.String;@106d69c, [Ljava.lang.String;@52e922]
System.out.println(Arrays.deepToString(deepArray));

How to efficiently iterate over each entry in a Java Map

Map<String, String> map = ...
for (Map.Entry<String, String> entry : map.entrySet()) {
    System.out.println(entry.getKey() + "/" + entry.getValue());
}

#java #interviewquestions #search

How to binary search in Java

import java.util.Stack;

/**
 * Java Program to implement a binary search tree. A binary search tree is a
 * sorted binary tree, where value of a node is greater than or equal to its
 * left the child and less than or equal to its right child.
 * 
 * @author WINDOWS 8
 *
 */
public class BST {

    private static class Node {
        private int data;
        private Node left, right;

        public Node(int value) {
            data = value;
            left = right = null;
        }
    }

    private Node root;

    public BST() {
        root = null;
    }

    public Node getRoot() {
        return root;
    }

    /**
     * Java function to check if binary tree is empty or not
     * Time Complexity of this solution is constant O(1) for
     * best, average and worst case. 
     * 
     * @return true if binary search tree is empty
     */
    public boolean isEmpty() {
        return null == root;
    }

    
    /**
     * Java function to return number of nodes in this binary search tree.
     * Time complexity of this method is O(n)
     * @return size of this binary search tree
     */
    public int size() {
        Node current = root;
        int size = 0;
        Stack<Node> stack = new Stack<Node>();
        while (!stack.isEmpty() || current != null) {
            if (current != null) {
                stack.push(current);
                current = current.left;
            } else {
                size++;
                current = stack.pop();
                current = current.right;
            }
        }
        return size;
    }


    /**
     * Java function to clear the binary search tree.
     * Time complexity of this method is O(1)
     */
    public void clear() {
        root = null;
    }

}

#java #java #2dchar array

How do you check a row in a 2D char array for a specific element and then count how many of that element are in the row? (Java)

private boolean oneQueenPerRow() {
    int foundQueens;
    for (int i = 0; i < board.length; i++) {
        foundQueens = 0;//each loop is a checked row
        for (int j = 0; j < board.length; j++) {
            if (board[i][j] == QUEEN)
                foundQueens++;
        }
        if (foundQueens > 1) return false;
    }
    return true;
}

Finding all classes implementing a specific interface

public <T> List<Class<? extends T>> findAllMatchingTypes(Class<T> toFind) {
    foundClasses = new ArrayList<Class<?>>();
    List<Class<? extends T>> returnedClasses = new ArrayList<Class<? extends T>>();
    this.toFind = toFind;
    walkClassPath();
    for (Class<?> clazz : foundClasses) {
        returnedClasses.add((Class<? extends T>) clazz);
    }
    return returnedClasses;
}

#java #gfg #geeksforgeeks #lecture #recursion #rope cutting

Rope Cutting Problem

import java.io.*;
import java.util.*;

class GFG 
{
	static int maxCuts(int n, int a, int b, int c)
	{
		if(n == 0) return 0;
		if(n < 0)  return -1;

		int res = Math.max(maxCuts(n-a, a, b, c), 
		          Math.max(maxCuts(n-b, a, b, c), 
		          maxCuts(n-c, a, b, c)));

		if(res == -1)
			return -1;

		return res + 1; 
	}
  
    public static void main(String [] args) 
    {
    	int n = 5, a = 2, b = 1, c = 5;
    	
    	System.out.println(maxCuts(n, a, b, c));
    }
}

#java #gfg #geeksforgeeks #arrays #practice #frequencycount #frequencies #limitedrange

Frequencies of Limited Range Array Elements

class Solution{
    //Function to count the frequency of all elements from 1 to N in the array.
    public static void frequencyCount(int arr[], int N, int P)
    {
        //Decreasing all elements by 1 so that the elements
        //become in range from 0 to n-1.
        int maxi = Math.max(P,N);
        int count[] = new int[maxi+1];
        Arrays.fill(count, 0);
        for(int i=0;i<N;i++){
            count[arr[i]]++; 
        }
        
        for(int i=0;i<N;i++){
            arr[i] = count[i+1];
        }
    }
}

#android #java #xml

Android LinearLayout gradient background

<?xml version="1.0" encoding="utf-8"?>
<shape xmlns:android="http://schemas.android.com/apk/res/android">
    <gradient
        android:angle="45"
        android:startColor="#ff00ff"
        android:endColor="#000000"/>
</shape>

> More steps

Its just print some message on console

for(int i = 0; i < 108; i++) {
System.out.println('Jai Shri Ram!');
}

Intent to Start New Activity in Android Studio

// IntendedActivity - the file you wish to open
// CurrentActivity - the file where this code is placed  

Intent intent = new Intent (this, IntendedActivity.class);
    CurrentActivity.this.startActivity(intent);

Insertion Sort in Java

 public void sort(int array[]) { 
     for (int i = 1; i < array.length; i++) { 
          int key = array[i]; 
          int j = i - 1; 
          while (j >= 0 && array[j] > key) { 
              array[j + 1] = array[j]; 
              j = j - 1; 
          } 
          array[j + 1] = key; 
      } 
 }

> More steps

Storing data in SQLite Database in android

public class LocalDatabase extends SQLiteOpenHelper {
         
    private static final String mDatabaseName = "LocalDatabase";
    private static final int mDatabaseVersion = 1;

public LocalDatabase(Context context) {
        super(context, mDatabaseName, null, mDatabaseVersion);
        SQLiteDatabase db = this.getWritableDatabase();
    }      

}

> More steps

How to use Alarm Manager in android?

    AlarmManager alarmManager;

> More steps

Browse more snippets >>