yossicohen / heuristic-search-max Goto Github PK

I'm not very familiar with C#, but I see that you have referenced Standley's cooperative pathfinding publication. Have you realized/coded this algorithm, and where can I find it?

Todo:

• change objective to Min-Max, the G value of a box is the shortest snake value.

• • Use only OD
• • Heuristic shortest reachable heuristic between all snakes
• • disable wait moves

• Add initial virtual starting point - from there start all possible permutation of starting points and use single open list

Add data to LOG:

• Grid H/W

• Num of Odd/Even

• Num of BlockedOdd/BlockedEven

• Add CPU cycles to the log

• Add generator with control over blocked (add/even)
  i.e. (BlkOdd=5,BlkEven=5) (BlkOdd=6,BlkEven=4) (BlkOdd=7,BlkEven=3) (BlkOdd=8,BlkEven=2)

• Impl. Alternate H based on parity check for every block separatly

• Create exp set that all runs are finished - what's not finished isn't comparable

• Impl. BCC based solver - different threads to each block (Low)

• Tests names to match the success criteria