Subship

I've come up with an idea for an interesting alternative game of battleship. I call is sub-hunt. Each player only has one piece each, either a sub or a destroyer and each only takes up one square. The player's pieces start out several squares away from each other facing random directions. The players cannot see the location of their opponent's pieces unless told. The players then take turns. On his turn, a player has one of three options: move, attack, or up-parascope/ping. If a player chooses to move, he can move in any direction, exactly one square, or remain in place. If he chooses to attack, he must announce the location and orientation of his piece aloud. Then, depending on whether he is the sub or the destroyer, his opponent signals whether he was hit or not. If he is the destroyer, the sub is hit if it occupies the same square as the destroyer. Else, if he is the sub, the destroyer is his if it stands in the current path of the sub. Hits can be tallied for a win. If the player chooses to ping/up-parascope, both players must then announce their locations.


A quick example game:

Whatsay a game starts with this position:
/ - - - - - \
| * * * * * |
| * s * * * |
| * * * * * |
| * * * d * |
| * * * * * |
\ - - - - - /
Neither player is aware of the location of the other player.

Assuming it is the destroyer's turn first, he can move, attack, or ping. Let's say that he moves:
/ - - - - - \
| * * * * * |
| * s * * * |
| * * * d * |
| * * * * * |
| * * * * * |
\ - - - - - /
Still, neither player is aware of the location of the other player.

Now it is the sub's turn and he has the same options. Let's say that he up-parascopes:
/ - - - - - \
| * * * * * |
| * s * * * |
| * * * d * |
| * * * * * |
| * * * * * |
\ - - - - - /
The map is the same, but both players have to tell the other where their piece is.

It's the destroyer's turn and he moves:
/ - - - - - \
| * * * * * |
| * s d * * |
| * * * * * |
| * * * * * |
| * * * * * |
\ - - - - - /
At this point, the destroyer still knows where the sub is, but the sub only knows where the destroyer has been. He can guess where the destroyer has just moved to, and he knows where the destroyer could not have moved to, but he doesn't know for sure. There are exactly nine square where the destroyer might be. The sub is currently pointed in the 4:30 direction (down and to the right.) This covers two of the possible squares so if the sub chooses to fire, he has a two in nine chance of hitting the destroyer:
What the sub knows: The sub's chances:
/ - - - - - \ / - - - - - \
| * * * * * | | * * * * * |
| * s . . . | | * s . . . |
| * * . . . | | * * + . . |
| * * . . . | | * * . + . |
| * * * * * | | * * * * + |
\ - - - - - / \ - - - - - /

So, the sub has one of two choices, either fire and hope to hit the destroyer, or move, and hide from the destroyer. Our sub decides to hide and moves down one:
/ - - - - - \
| * * * * * |
| * * d * * |
| * s * * * |
| * * * * * |
| * * * * * |
\ - - - - - /

This would continue until one or the other scored enough hits on the other to constitute a win.