Elasticsearch based secondary index for Cassandra used by Genesys UCS
-
Updated
Sep 1, 2025 - Java
Elasticsearch based secondary index for Cassandra used by Genesys UCS
USC-Foundations of Artificial Intelligence Codes
DFS, BFS, IDS, UCS, Bi-directional, A*, IDA*, SMA*...
Two board games. Simple algorithms are used to simulate the AI player or find the optimal solution.
✨ Late-night Java AI coding adventures from my college days! Path-finding algorithms, genetics, prolog and other codes that compile and run perfectly. All implemented in Java for your programming assignments and projects! ☕💡
Uses UCS and AStar algorithms and PALESTINE map to find the shortest path.
Implementation of UCS and IDA* algorithms, using them to calculate paths in a city based on traffic predictions.
An application that uses A* algorithm and uniform cost search to solve 8-puzzle.
This repository implements a solver for an extended 8-Puzzle game, where blocks can move diagonally, using Breadth-First Search (BFS) and A* search algorithms.
Solve "ShipWreck" game using Intelligent Search Algorithms
Solving Rush Hour 2 Puzzle Using Pathfinding Algorithm
Algorithm that solves the classic 8-puzzle game with the use of Uniform Cost Search Algorithm (UCS) and A-star(A*) method in both Python and Java.
Add a description, image, and links to the ucs topic page so that developers can more easily learn about it.
To associate your repository with the ucs topic, visit your repo's landing page and select "manage topics."