GitHub / shuai-yang / A-practice-for-AI-search-algorithm-solving-CSPs
This is a practice for AI Search Algorithm. Grocery Bagging is a Constraint Satisfaction Problem (CSP). I used Backtracking search algorithm (Depth-First-Search) along with arc-consistency, Most Restrictive Value (MRV) and Least Constraining Value (LCV) heuristics for prioritizing and pruning to solve the problem as efficiently as possible.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuai-yang%2FA-practice-for-AI-search-algorithm-solving-CSPs
PURL: pkg:github/shuai-yang/A-practice-for-AI-search-algorithm-solving-CSPs
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Java
Size: 222 KB
Dependencies parsed at: Pending
Created at: over 3 years ago
Updated at: 10 months ago
Pushed at: over 3 years ago
Last synced at: 10 months ago
Topics: arc-consistency-algorithm, artificial-intelligence, constraint-satisfaction-problem, dfs-search, lcv-heuristic, mrv-heuristic, search-algorithm