arthurgassner/tendersnake

tendersnake's Issues

Compress the tree

The reason BFS sucks balls is that all the goal nodes are at the same level, at the bottom of the tree.

So when using BFS, it is basically gonna evaluate the whole tree before stumbling upon the bottom layer, and pick the first goal state it finds.

The solution to that problem is to compress the tree vertically, by allowing the different in actions between two nodes to be more than 1.

Make A* underestimating actually underestimate

Boundary Conditions

Not sure if it's expected, but it may be worth testing our code for robustness against invalid or extreme user input (e.g. negative or zero tasks input, etc).

onmyway issue

The issue is the following :

I'm in city A. I have a task to deliver in B and on in C. If B is on the path from A to C, I should automatically deliver it.

The solution is the following :

On generatechildrenfrompickups() check for each possible pickup task: does one of the currently carried tasks have a destination on the path to the pickup destination.
If yes, create node ONLY for dropoff task. Let agent reevaluate to do pickup afterwards. Ensure that a duplicate node is not created when generatechildrenfromdropoffs() is called.

Make ASTAR more efficient

ASTAR doesn't actually need a whole tree as its entry. Just giving it the rootNode should be sufficient and more efficient