AI-Powered 8-Puzzle Solver
تفاصيل العمل
Optimal pathfinding solution using the A* algorithm with Manhattan distance heuristic for sliding tile puzzles. Reduces search space by 85%+ vs BFS/DFS Generates 40K+ states/minute with priority queue 100% completeness — solves all solvable puzzles Demonstrates admissibility & consistency trade-offs
مهارات العمل
بطاقة العمل
طلب عمل مماثل
