A Game Instance Analysed

The Lions trouncing Bombers - Analysed?

Yes, a very good game, very enjoyable, but not the game I am talking about.

Hyperion DJTvPGS20090430-1(Game-3-Series-4x4-1)

Permutation analysis from Turn 10 - leads to approximately 200,000,000,000 permutations (upper limit). This is currently being worked out by a program, it is, I estimate, half way through. It is computing at 1.3M permutations (without scoring) per second. I estimate that will slow by a factor of 10 with scoring.

>>96895000000> 8)(-1,0)- (-1,0)- (3,2)P (1,0)S (0,0)K (1,1)X (0,0)X (0,3)K (3,0)K (2,3)K (3,3)S
>>96896000000> 8)(-1,0)- (-1,0)- (3,2)P (1,0)S (0,0)K (3,2)X (3,3)P (2,3)K (1,2)X (0,3)P (3,0)K
>>96897000000> 8)(-1,0)- (-1,0)- (3,2)P (1,0)S (0,0)K (0,3)S (0,3)X (1,0)X (3,0)A (3,3)K (2,3)S

It also is an upperlimit as the Neutralise* piece is being used on every piece, not just scored pieces.

Turn 9 was when Player 1 sprung the Universal, and at the end of the turn the scores were 6-0. Currently, the series stands at DJT 2 - PGS 1. PGS leads the next game, and the pressure will be on to level the series.

Stage 2 of this program (when written) will also calculate all permutations of scores. This will be interesting.
....
Now at :
>>133850000000> 8)(-1,0)- (-1,0)- (2,3)K (0,0)S (1,0)A (3,2)S (3,3)K (3,0)S (0,0)X (2,0)X (0,3)S
>>133851000000> 8)(-1,0)- (-1,0)- (2,3)K (0,0)S (1,0)A (0,3)S (3,0)S (2,1)X (2,0)X (3,3)S (3,2)S
>>133852000000> 8)(-1,0)- (-1,0)- (2,3)K (0,0)S (1,0)A (3,3)K (3,2)K (3,0)K (0,2)X (1,0)X (0,3)K
>>133853000000> 8)(-1,0)- (-1,0)- (2,3)K (0,0)S (1,0)K (1,0)X (3,3)S (3,0)S (2,3)X (0,3)S (3,2)S

Run finished!!!
167,434,999,200
That's 167 Billlllllliiooooon permutations!