Naive Path Finding

Поділитися
Вставка
  • Опубліковано 8 січ 2025

КОМЕНТАРІ • 3

  • @philippaps44
    @philippaps44 Рік тому

    is there a way to avoid two points using the same next position at the same time? it should run point by point somehow and not all points at the same time? but that would make it significantly slower. if there was a way to store all picked positions and then see if there are duplicates and prioritize randomly one point to occupy the next position each iteration, or pick the next best free position

    • @philippaps44
      @philippaps44 Рік тому

      running the algorithm in a detail wrangle storing the next positions in an array using a locking mechanism and applying the attributes with another detail wrangle did the trick. in a solver

  • @Denjo92
    @Denjo92 10 місяців тому

    11:17