volume command

[kostmo]

Measures the volume of an enclosed space.
A useful alternative to the path command for goal checking.

Demo

scripts/play.sh -i data/scenarios/Testing/1747-volume-command.yaml --autoplay --speed 2

[byorgey]

This command doesn't seem all that useful to me, but I'm guessing you must have some particular use case(s) in mind?

[kostmo]

some particular use case(s) in mind?

Yes. I don't have a particular use case for player robots, but I envision some interesting gameplay mechanics involving "enclosure" when used by system robots/goal conditions. The integration test scenario is one example. In contrast with the gated-paddock scenario, which used the path command to test for a route to a surrounding "ocean" to determine enclosure by a fence, this volume command does not require an extra surrounding entity layer, so long as there exists a maximum expected enclosure size.

A few scenario ideas:

1. Caterpillar robots that turn into butterflies when snugly enclosed in a cocoon
2. Defeating opponents by trapping them
3. Excavating a burrow or mine of sufficient size as a goal (in combination with portals)

[byorgey]

Ah, OK, yes, those sound nice!

[byorgey]

This comment seems a little misleading --- the reason for prepending the visitableNeighbors is because we're treating pending as a stack rather than a queue, not because it is more efficient (though I agree it will be). Regardless of which list is shorter, prepending the visitableNeighbors will take constant time per new neighbor, and hence $O(n)$ overall since each vertex occurs as a new neighbor at most once. Whereas appending visitableNeighbors will take time linear in the number of vertices in the queue, but the same vertices might be in the queue for multiple iterations, so we can end up doing more than $O(n)$ work appending.

[kostmo]

the reason for prepending the visitableNeighbors is because we're treating pending as a stack rather than a queue, not because it is more efficient (though I agree it will be)

Well, I originally went about this intending to implement BFS, until I got to this line and realized that appending to the pending list would be expensive (and I couldn't be bothered to use Seq instead of []). So I decided to prepend instead, which turned it into DFS.