Last active
October 15, 2024 10:31
-
-
Save jonathan-irvin/97537512eb65a8bbcb9a to your computer and use it in GitHub Desktop.
Connect 4 in Java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.Scanner; | |
public class Connect4 { | |
public static void main(String[] args) { | |
Scanner in = new Scanner(System.in); | |
char[][] grid = new char[6][7]; | |
//initialize array | |
for (int row = 0; row < grid.length; row++){ | |
for (int col = 0; col < grid[0].length; col++){ | |
grid[row][col] = ' '; | |
} | |
} | |
int turn = 1; | |
char player = 'R'; | |
boolean winner = false; | |
//play a turn | |
while (winner == false && turn <= 42){ | |
boolean validPlay; | |
int play; | |
do { | |
display(grid); | |
System.out.print("Player " + player + ", choose a column: "); | |
play = in.nextInt(); | |
//validate play | |
validPlay = validate(play,grid); | |
}while (validPlay == false); | |
//drop the checker | |
for (int row = grid.length-1; row >= 0; row--){ | |
if(grid[row][play] == ' '){ | |
grid[row][play] = player; | |
break; | |
} | |
} | |
//determine if there is a winner | |
winner = isWinner(player,grid); | |
//switch players | |
if (player == 'R'){ | |
player = 'B'; | |
}else{ | |
player = 'R'; | |
} | |
turn++; | |
} | |
display(grid); | |
if (winner){ | |
if (player=='R'){ | |
System.out.println("Black won"); | |
}else{ | |
System.out.println("Red won"); | |
} | |
}else{ | |
System.out.println("Tie game"); | |
} | |
} | |
public static void display(char[][] grid){ | |
System.out.println(" 0 1 2 3 4 5 6"); | |
System.out.println("---------------"); | |
for (int row = 0; row < grid.length; row++){ | |
System.out.print("|"); | |
for (int col = 0; col < grid[0].length; col++){ | |
System.out.print(grid[row][col]); | |
System.out.print("|"); | |
} | |
System.out.println(); | |
System.out.println("---------------"); | |
} | |
System.out.println(" 0 1 2 3 4 5 6"); | |
System.out.println(); | |
} | |
public static boolean validate(int column, char[][] grid){ | |
//valid column? | |
if (column < 0 || column > grid[0].length){ | |
return false; | |
} | |
//full column? | |
if (grid[0][column] != ' '){ | |
return false; | |
} | |
return true; | |
} | |
public static boolean isWinner(char player, char[][] grid){ | |
//check for 4 across | |
for(int row = 0; row<grid.length; row++){ | |
for (int col = 0;col < grid[0].length - 3;col++){ | |
if (grid[row][col] == player && | |
grid[row][col+1] == player && | |
grid[row][col+2] == player && | |
grid[row][col+3] == player){ | |
return true; | |
} | |
} | |
} | |
//check for 4 up and down | |
for(int row = 0; row < grid.length - 3; row++){ | |
for(int col = 0; col < grid[0].length; col++){ | |
if (grid[row][col] == player && | |
grid[row+1][col] == player && | |
grid[row+2][col] == player && | |
grid[row+3][col] == player){ | |
return true; | |
} | |
} | |
} | |
//check upward diagonal | |
for(int row = 3; row < grid.length; row++){ | |
for(int col = 0; col < grid[0].length - 3; col++){ | |
if (grid[row][col] == player && | |
grid[row-1][col+1] == player && | |
grid[row-2][col+2] == player && | |
grid[row-3][col+3] == player){ | |
return true; | |
} | |
} | |
} | |
//check downward diagonal | |
for(int row = 0; row < grid.length - 3; row++){ | |
for(int col = 0; col < grid[0].length - 3; col++){ | |
if (grid[row][col] == player && | |
grid[row+1][col+1] == player && | |
grid[row+2][col+2] == player && | |
grid[row+3][col+3] == player){ | |
return true; | |
} | |
} | |
} | |
return false; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment