I am going to try to participate in the Google AI Contest, writing a Tron AI. Wish me luck. From the videos, there seem to be two points in the game:
1. (Online) Trap Them / Isolate yourself.
2. (Online) Find a maximally Hamiltonian path on your isolated sub graph.
Current Ideas:
(First some preliminaries, I vision the field as a Graph, with a vertex set and edge set.)
(Concerning topic 1.)
Find min-cuts in the graph. All of them within a certain criteria.
1. If the graph is more open (larger min-cuts, with little below max) then an openly aggressive opponent strategy would seem appropriate.
2. If the graph is more closed (very low min-cuts, with several near minimal) then a shortest path to cut off more than 50% of the map would seem more appropriate.
(Concerning topic 2.)
As the game no longer depends on what the opponent does, calculate maximally covering(with exits!) successively bigger in size.
That's all for now. Off to develop topic 1.
No comments:
Post a Comment