This repository contains solutions to various AI-based puzzle problems from LeetCode. Each problem involves an intelligent search or optimization technique to find the best solution efficiently.
-
N-Queens Problem (Link)
- Implemented a backtracking algorithm to place N queens on an N×N chessboard such that no two queens attack each other.
-
Tic-Tac-Toe Solver (Link)
- Developed a function to determine the winner of a Tic-Tac-Toe game given a series of moves.
-
Sudoku Solver (Link)
- Used backtracking to fill an incomplete 9×9 Sudoku board while ensuring the validity of the solution.
-
Traveling Salesman Problem (TSP) (Link)
- Solved using a dynamic programming approach with bit masking to find the shortest superstring covering all given strings.
-
8-Puzzle Problem (Link)
- Implemented the A* search algorithm to find the shortest sequence of moves to solve the sliding puzzle.
Feel free to fork the repository and contribute by adding optimizations or new AI-related problems!