Implementation of Greedy, Uniform Cost Search (UCS), and A* Search algorithms to find seating arrangements with minimal conflict.
-
Updated
Jul 17, 2024 - Java
Implementation of Greedy, Uniform Cost Search (UCS), and A* Search algorithms to find seating arrangements with minimal conflict.
Optimizing a round table seating arrangement using algorithms including: Genetic Algorithm, Simulated Annealing Algorithm, and Hill Climbing Algorithm.
Add a description, image, and links to the seating-arrangement topic page so that developers can more easily learn about it.
To associate your repository with the seating-arrangement topic, visit your repo's landing page and select "manage topics."