ICAPS 2014: Daniel Harabor on "Improving Jump Point Search"

Поделиться
HTML-код
  • Опубликовано: 24 ноя 2024

Комментарии • 12

  • @WingMaster562
    @WingMaster562 Год назад +4

    10:08 "It's not that exciting"
    But, that's what I came here for. Boring stuff. The things that make it work. lmao

  • @Maric18
    @Maric18 3 года назад +8

    i cant believe that this is the only resource available on jps

    • @WingMaster562
      @WingMaster562 Год назад +3

      IKR. I really find it odd that for an efficient algorithm and suggested a lot in forums, it has really few resources for it. Aside the main paper, I can only find the introduction (which kept repeating things) by other people and one visualizer.
      I can't find a reliable pseudocode that I can understand. Nor a proper tutorial, just introductions.

    • @figfox2425
      @figfox2425 6 месяцев назад

      if you have some questions, I did an implementation of the classic jps and the improved one.The hard part was the twikling bits i had to figure out. (and probably not as bright as what they did)

  • @Egzvorg
    @Egzvorg 9 лет назад +1

    and what about uniform-cost graphs, which cannot be represented as grid?

    • @rahpuser
      @rahpuser 8 лет назад

      +Егор Зворыкин Did you mean "non-uniform cost" ?

    • @Egzvorg
      @Egzvorg 8 лет назад

      rahpuser no

    • @rahpuser
      @rahpuser 8 лет назад +1

      Егор Зворыкин Grid are represented as uniform graphs, what do you mean by uniform graphs that cannot be represented as grid ?

    • @Egzvorg
      @Egzvorg 8 лет назад

      rahpuser any other graph with uniform cost for example {3, 2, 2, 3}.

    • @Egzvorg
      @Egzvorg 8 лет назад

      rahpuser well, never mind, I don't even remember why I was asking this.