Alternating # and . cells, like a chess board. The logic is explained step by step, and the full program is given in C, C++, Java and Python.
This program is part of the Symbol Patterns collection.
Checkerboard Pattern output
Output (n = 6):
# . # . # . . # . # . # # . # . # . . # . # . # # . # . # . . # . # . #

How the checkerboard pattern works
Neighbouring cells always differ by one in i + j, so testing whether i + j is even alternates the two symbols in both directions.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
npositions in the row. Print#symbols where(i + j) % 2 = 0; print.symbols everywhere else. - Move to the next line.
Checkerboard Pattern in C
#include <stdio.h>
int main(void) {
int n = 6;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((i + j) % 2 == 0)
printf("# ");
else
printf(". ");
}
printf("\n");
}
return 0;
}Checkerboard Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 6;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((i + j) % 2 == 0)
cout << "# ";
else
cout << ". ";
}
cout << endl;
}
return 0;
}Checkerboard Pattern in Java
public class CheckerboardPattern {
public static void main(String[] args) {
int n = 6;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((i + j) % 2 == 0)
System.out.print("# ");
else
System.out.print(". ");
}
System.out.println();
}
}
}Checkerboard Pattern in Python
n = 6
for i in range(1, n + 1):
for j in range(1, n + 1):
if (i + j) % 2 == 0:
print("# ", end="")
else:
print(". ", end="")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).





