105 skills found · Page 1 of 4
dbrizov / Unity PathFindingAlgorithmsBFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms
citiususc / HipsterHipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.
joney000 / Java Competitive ProgrammingI've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...
PathPlanning / AStar JPS ThetaStarBasic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*
ooanishoo / Family Tree🌳👨👩👦 A family tree data structure that uses BFS to traverse through the tree to search members and find relationships. Built with @reactjs NextJs, Typescript and Tailwind CSS. Deployed through @vercel
hayderkharrufa / Snake Pathfinding AIAI plays snake game using BFS (Breadth-First Search) algorithm.
alex-rantos / Project 1 Search In PacmanSearch algorithms(BFS, DFS, UCS, A*) in python.Berkeley Pacman Project 1.
GasserElAzab / APF BFS Astar Path Planning Technquies Simulated On Turtltebot3 Gazebo ROSThis project is mainly about testing different path planning techniques in a certain world full of obstacles and how turtlebot3 managed to get to the goal position. It tackles 3 path planning technquies which are ( Artificial potential field (APF), Breadth first search (BFS), A*).
brpapa / Pathfinding Visualizer🔍 A friendly visualizer for some search algorithms like DFS, BFS, Greedy and A*
main-- / Rust EytzingerThis crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array).
garrethlee / Algorithmic Maze RunnerA Python-based application demonstrating various search algorithms, namely Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search (Manhattan Distance Heuristic)
deepeshmittal / AI PacMan ProjectsImplemented various AI algorithms in Pac-Man projects developed by UC Berkeley. Implemented informed/blind state-space search using search algorithms like BFS, DFS, UCS and A* algorithm with heuristic calculation. Designed an algorithm for reflex agent, minimax and alpha-beta pruning. Reinforcement Learning using MDP (Value Iteration and Policy Evaluation) - Implemented Markov Decision process using Value iteration in the Pacman World. Designed perceptron classifier for data classification. Developed applications using python. http://ai.berkeley.edu/project_overview.html
aguunu / Fishing JigsawCompute optimal actions for a specific state of the Metin2 fishing jigsaw making use of reinforcement learning principles.
Madhvendra21 / Rubik Cube SolverUsed three unique class designs to shape the cube, each using simple C++ structures like arrays and lists. Added three search methods—BFS, DFS, and IDDFS—to solve the cube when mixed up to 8 times, all under 3 seconds. Put in Korf’s IDA* method, which can untangle a cube scrambled 13 times in less than 10 seconds.
mateusememe / 8 PuzzleUsing heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
stamd / Graphs In PythonNo description available
NhanPhamThanh-IT / SmartEscape RushHour🚗 AI-powered Rush Hour puzzle solver with Pygame GUI. Features BFS, DFS, UCS & A algorithms to solve traffic jam puzzles. Compare AI performance metrics, play manually, or watch automated solutions. Educational tool for learning search algorithms.
emikhalev / AlgorithmThis is the collection of solutions to some computer problems, mainly leetcode
aahuja9 / Pacman AIBFS, DFS, A*, and Uniform Cost Search Algorithms implemented for Pacman game
sevdaimany / AI Search Project👁🗨🧠 Artificial Intelligence search project implementing IDS, Bidirectional BFS and A*.
