Pathfinding Algorithm Comparison

Research: A* vs Greedy Best-First vs MCTS pada Maze dengan Dynamic Obstacles

Start

Goal

Wall

Moving Obstacle

Path

Agent

Pilih Algoritma:

A*

Greedy BFS

MCTS

Obstacle Speed: 5

Number of Obstacles: 20

Current Statistics

Algorithm: A*

Path Length: -

Computation Time: -

Nodes Explored: -

Success: -

Replanning Count: -