Adversarial Nanomunchers

Problem description


In a complete grid, without any disturbance, a nanomuncher will run in a concentric pattern.


Complete Grid:
Put one nanomuncher in one of the two square area (A, B) for earning most score. Choose the other one in the center area (C) for defense purpose which cooperates best with the first nanomuncher.

Partial Grid:
Get around 15 best score pairs as if you are the only player. Delete those start at dead end path which may be easily blocked or killed. And pick up those start with higher priority rules pairs.

C++ Solaris Socket wrapper:

Kai-Hui (Kevin) Huang, khh220 [at]