Thanks SirVir, that helps much!
Til now i only figured out, that the script crashes with a memory execption.
This is because it creates distinct groups for not only the groups you described, but also takes the orientations into account which results in e.g. 9 groups (8x walking + 1 idle).
Generating the permutations for this to do the "try packing" crashes even before it can try ;) . I think this a NP-hard problem...
We can't produce a optimal solution in linear time, so i will try to bring that down to a sub-optimal solution based on less groups. (e.g. don't try base walk_NE with walk_SW as base....)
Thanks SirVir, that helps much!
Til now i only figured out, that the script crashes with a memory execption.
This is because it creates distinct groups for not only the groups you described, but also takes the orientations into account which results in e.g. 9 groups (8x walking + 1 idle).
Generating the permutations for this to do the "try packing" crashes even before it can try ;) . I think this a NP-hard problem...
We can't produce a optimal solution in linear time, so i will try to bring that down to a sub-optimal solution based on less groups. (e.g. don't try base walk_NE with walk_SW as base....)