Which Strategies Survive Iterative Deletion in Game Theory?

[blablabl]

I would like to know which strategies survive iterative deletion of strictly dominated strategies

D E F
A 0, 1 0, 0 10, 4/5
B 3, 1 1, 2 0, 1
C 1, 5/2 2, 3/2 0, 2

Since there are only weakly dominated strategies, the answer is A, B, C and D, E, F. Is this correct?*

 

[Chronos]

That is a failed AI strategy, that a pattern based algorithm can find an infallible solution to any problem. Were that true we would already have infallible chess programs. We don't. Either there is no such algorithm, or, we are too dumb to figure it out.