Skip to main content

Tic Tac Toe Python 3: The Standard Tic-Tac-Toe Game in Python 3

I just finished Tic tac toe game as my first python project. This is a very simple classic game, for beginners in programming tic-tac-toe game is the best choice. I am using Jupyter notebook, you can use any python ide like Pycharm, Spyder etc.

Scenario of tic-tac-toe game:

Your task is to write a simple program which pretends to play Tic-tac-toe game with the user. To make it easier for you. We have decided to simplify the game. Here are our assumptions.

  • the computer should play a game using 'X'
  • the user should play a game using 'O'
  • the first move belongs to the computer, it always 'X' in the middle of the board. 
Tic Tac Toe Python 3: The Standard TicTacToe Game in Python 3
  • all squares are numbered row by row, start with '1'.
  • the user move is to enter the number of the square they choose, the number must be valid, that is it must be an integer, it must be greater than  0 and less than 10, and it cannot point to a field which is already occupied.
  • the program checks the game is over, there are four possibilities- the game should continue, the game should tie, computer's win and you win.
  • don't implement any form of artificial intelligence's, a random field is chosen by a computer this is enough for the game.
John Academy

Requirements to build tic-tac-toe game:

  1. Better knowledge about if-elif-else, for-while loop, tuple, list, function.
  2. Draw a random function you can use randrange() 

from random import randrange

for i in range(10): print(randrange(8))  

1. Display Board function of tic-tac-toe game:

The function accepts one parameter containing the board's current status and prints it out to the console.

2.Enter a move:

The function accepts the board current status, asks the user about their move,  checks the input and updates the board according to the user's decision.

3. Make a list of the free field:

The function browses the board, builds a list of all the free squares and the list consists of tuples, while each tuple is a pair of row-column numbers.

4.Victory for :

The function analyzes the board status to check if the player using 'O's or 'X's has won the game.

5.Draw move:

The function draws the computer's move and updates the board.

6.Main program:

And then combine this function so, the main program:

Labels:

Comments

  1. Sam7/04/2021

    I am developer and i make a website check it.

    ReplyDelete
  2. Anonymous9/27/2023

    Hi. Can you share the code please? (able to be copied)

    ReplyDelete
  3. Anonymous1/21/2024

    Hello, at the victor, the last if it's actually: board[2-rc][rc] != sign so it can take the other cross correctly.

    ReplyDelete
  4. Anonymous12/24/2024

    Thank You and I have a tremendous proposal: What Home Renovation Shows Are On Netflix home remodel cost

    ReplyDelete

Post a Comment

Thanks for the comment.

Popular posts from this blog

Java Program: To Check If A Number Is Prime In Java

In this java program, we have one positive input and check whether the given number is prime or not. Read what is Prime Number . The simple case to check prime number we do, if (number % 2 == 0){ print("Not prime");} else { print("is prime");} But its complexity is much high if we use for loop . To decrease the complexity of the program read below question and solution. Tic Tac Toe Python 3: The Standard Tic-Tac-Toe Game in Python 3 Java Program: Question You've to check whether a given number is prime or not. A number "t" as input representing a count of input numbers to be tested. Number "n" as input "t" number of times. For each input value of n, print "prime" if the number is prime and "not prime" otherwise. Explanation and sample input Input Format : t n A number n .. t number of times Output Format : prime not prime not prime .. t number of times Constraint...
Post a Comment
Read more

Knapsack Problem Java

Question You are given a number n, representing the count of items. You are given n numbers, representing the values of n items. You are given n numbers, representing the weights of n items. You are given a number "cap", which is the capacity of a bag you've. You are required to calculate and print the maximum value that can be created in the bag without overflowing its capacity. Note -> Each item can be taken 0 or 1 number of times. You are not allowed to put the same item again and again. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A number representing the maximum value that can be created in the bag without overflowing its capacity Constraints 1 <= n <= 20 0 <= v1, v2, .. n elements <= 50 0 < w1, w2, .. n elements <= 10 0 < cap <= 10 Sample Input 5 15 14 10 45 30 2 5 1 3 4 7 Sample Output 75 Program import java.io.*; ...
Post a Comment
Read more

Patterns: Java Program To Print Patterns Of Numbers And Stars

Patterns are most important for interview point of view. To understand pattern problem you know only the basic tactic of how to solve pattern problem. In Java, it becomes a little bit easier to code patterns problems. In this article we discuss 20 basic pattern problem in java. Java Program: To Check If A Number Is Prime In Java Lets get start :) Patterns In Java 1. Left Triangle Star Pattern : First, let us begin with the basic and the commonly asked pattern program in  Java  i.e This is the basic pattern in java to write its code . Their is only two loops are used one for row and another for column. Let’s write the java code: import java.util.*; public class Main { public static void main(String[] args) { Scanner scn = new Scanner(System.in); // write ur code here int n = scn.nextInt(); for (int i = 1; i <= n; i++){ for(int j = 1; j <= i; j++){ System.out.pr...
Post a Comment
Read more

Prime Number Program in Java: Is Number Prime Or Not

Question You've to check whether a given number is prime or not. Take a number "t" as input representing a count of input numbers to be tested. Take a number "n" as input "t" number of times. For each input value of n, print "prime" if the number is prime and "not prime" otherwise. Input Format A number t A number n A number n .. t number of times Output Format prime not prime not prime .. t number of times Constraints 1 <= t <= 10000 2 <= n < 10^9 Sample Input 5 19 21 33 37 121 Sample Output prime not prime not prime prime not prime Program import java.util.*; public class Main{ public static void main(String[] args) { Scanner scn = new Scanner(System.in); int t = scn.nextInt(); for(int i=0;i<t;i++){ int n = scn.nextInt(); int count = 0; for(int div=2;div*div<=n; div++){ if (n % div == 0){ ...
Read more

Prime Number Program in Java: Print All Prime Numbers

Question You've to print all prime numbers between a range. Take as input "low", the lower limit of the range. Take as input "high", the higher limit of the range. For the range print all the primes numbers between low and high (both included). Input Format low high Output Format n1 n2 .. all primes between low and high (both included) Constraints 2 <= low < high < 10 ^ 6 Sample Input 6 24 Sample Output 7 11 13 17 19 23 Program import java.util.*; public class Main{ public static void main(String[] args) { // write your code here Scanner scn = new Scanner(System.in); int low = scn.nextInt(); int high = scn.nextInt(); for (int i = low; i <= high; i++){ int count = 0; //try to divide n and incrtease count for (int div = 2; div * div <= i; div++){ if ( i % div == 0){ count++; ...
Post a Comment
Read more

Quick Sort In Java

Question You are given an array(arr) of integers. You have to sort the given array in increasing order using quicksort. Input Format An Integer n arr1 arr2.. n integers Constraints 1 <= N <= 100000 -10^9 <= arr[i] <= 10^9 Sample Input 5 7 -2 4 1 3 Sample Output pivot -> 3 Swapping -2 and 7 Swapping 1 and 7 Swapping 3 and 4 pivot index -> 2 pivot -> 1 Swapping -2 and -2 Swapping 1 and 1 pivot index -> 1 pivot -> -2 Swapping -2 and -2 pivot index -> 0 pivot -> 4 Swapping 4 and 7 pivot index -> 3 pivot -> 7 Swapping 7 and 7 pivot index -> 4 -2 1 3 4 7 Program import java.io.*; import java.util.*; public class Main { public static void quickSort(int[] arr, int lo, int hi) { //write your code here if(lo > hi){ return; } int pivot = arr[hi]; int pidex = partition(arr, pivot, lo, hi); quickSort(arr, lo, pidex - 1); quickSort(arr, pidex + 1, hi); } public...
1 comment
Read more

Fibonacci Java

Question You are given a number n. You are required to print the nth element of the Fibonacci sequence. Note -> Notice precisely how we have defined the Fibonacci sequence 0th element -> 0 1st element -> 1 2nd element -> 1 3rd element -> 2 4th element -> 3 5th element -> 5 6th element -> 8 Input Format A number n Constraints 0 <= n <= 45 Sample Input 10 Sample Output 55 Program import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { // write your code here Scanner scn = new Scanner(System.in); int n = scn.nextInt(); int ans = fib(n, new int[n + 1]); System.out.println(ans); } public static int fib(int n, int[] qb){ if(n == 0 || n == 1){ return n; } if(qb[n] != 0){ return qb[n]; } int fib1 = fib(n - 1, qb); ...
Post a Comment
Read more

Merge Sort In Java

Question You are given an array(arr) of integers. You have to sort the given array in increasing order using merge sort. Input Format An Integer n arr1 arr2.. n integers Constraints 1 <= N <= 100000 -10^9 <= arr[i] <= 10^9 Sample Input 5 7 -2 4 1 3 Sample Output Merging these two arrays left array -> 7 right array -> -2 Merging these two arrays left array -> -2 7 right array -> 4 Merging these two arrays left array -> 1 right array -> 3 Merging these two arrays left array -> -2 4 7 right array -> 1 3 Sorted Array -> -2 1 3 4 7 Program import java.io.*; import java.util.*; public class Main { public static int[] mergeSort(int[] arr, int lo, int hi) { //write your code here if(lo == hi){ int[] ba = new int[1]; ba[0] = arr[lo]; return ba; } int mid = (lo + hi) / 2; int[] fsh = mergeSort(arr, lo, mid); int[] ssh = mergeSor...
Post a Comment
Read more