LeetCode solutions
-
Updated
Jan 11, 2024 - Python
LeetCode solutions
Solving Sudoku with BackTrack Algorithm
sudoku game with the user interaction and also AI to solve complex grid(board)
8 puzzle and 15 puzzle game using Backtracking algorithm
we slove sudoku tables as a CSP problem using Backtrack algorithm with forward Checking and MRV and Degree heuristics.
sudoku detection, recognition and solution generation.
This is a basic search engine written in Python for ranking documents based on the proximity of query terms, featuring an indexing and ranked retrieval system for textual data.
Auto-synced LeetCode solutions Done by Me organized by difficulty, with language usage analytics and clean problem-level documentation.
I have created a project for my AI lab which includes solving a game problem using an AI technique
Using Data Structures and Algorithms to solve problems efficiently considering both space and time complexity constraints
The goal of this project is to use Deep Learning and the recursive backtracking algorithm to solve any sudoku puzzle.
Write a Mahjong hand-detection system using DFS and backtracking algorithms. Users can input their hand into the system, and the system will output the winning hand pattern.
Add a description, image, and links to the back-tracking topic page so that developers can more easily learn about it.
To associate your repository with the back-tracking topic, visit your repo's landing page and select "manage topics."