Here I used A*, IDS, and BFS to sort colored cards in ascending order.
In the initial state, we have different unsorted decks of cards (they could have different colors), and as output, you get sorted cards with the same color in each deck.
You can run the same test case on each algorithm to understand the great effect of the heuristic function on decreasing computation time by creating fewer nodes than BFS and IDS.
-
Notifications
You must be signed in to change notification settings - Fork 0
MohammadJavadArdestani/sort-colored-cards-with-AI-search-algorithms
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
use A*, IDS and BFS to sort colored cards in ascending order.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published