"Checkers, IIRC, a comparably simple game (at most... 24 pieces IIRC, on 32 squares with fairly limited branching factor) has actually been solved, 'tho."
----
Right. It's worthy of note to observe that even if we could represent a game like SEIV correctly using classical search (given the complexities and configurational flexibility, this is in doubt), it would actually be IMPOSSIBLE with today's hardware to solve the SEIV AI (or similar) problem using the same kinds of techniques which are used for Chess, Go, and Checkers. The combinatorial expansion is simply enormous.
As for Ben and Imp II, congratulations. I believe you pulled off an outstanding solution to computer "AI," and while I often had to play that game on easy, that's the way it should be.
Oh, BTW: CHEATER!!!
C//