Jul 9, 2025 · 4 min read · There’s brute force — and then there’s brute force with a brain. That’s what backtracking is.It’s the art of exploring possibilities... but only until you realize it’s a waste of time. Then you back out faster than when someone says, “We need to talk...
Join discussion
Jun 15, 2025 · 2 min read · Today, I dived into the N-Queens problem, a classic example of how backtracking can be used to solve constraint-based problems. ✅ What I Learned: The goal is to place N queens on an N x N chessboard so that no two queens threaten each other. I used...
Join discussionJan 3, 2025 · 8 min read · Backtracking is a fascinating and versatile algorithmic technique. It involves exploring all potential solutions to a problem by recursively attempting to build a solution one step at a time while removing the previous step if it doesn't lead to a va...
Join discussionAug 11, 2024 · 2 min read · This C program can solve the n-queen problem. #include <stdio.h> #include <conio.h> #include <stdlib.h> #include <stdbool.h> void printSolution(int **board, int n) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ...
Join discussion
Sep 5, 2023 · 6 min read · The N-Queens puzzle is like a chessboard conundrum on steroids. It challenges us to place N queens on an N×N chessboard in such a way that no two queens threaten each other. It's a classic example of a combinatorial problem, and it's taught in comput...
Join discussion
Dec 26, 2022 · 2 min read · Backtracking is an algorithmic technique for finding all solutions to a problem by exploring all possible paths and choosing the ones that lead to a solution. It involves choosing a path, making progress along that path, and then backtracking and cho...
Join discussion