AI in arbitrary world
This work addresses a foundational challenge in AI for arbitrary environments, but it is incremental as it applies to a simple, specific game.
The paper tackles the problem of building AI that can operate in arbitrary worlds by focusing on the game Tick-Tack-Toe, where the player cannot see the entire internal state and must construct a model; the result is a model based on finite automata and first-order formulas to understand the world.
In order to build AI we have to create a program which copes well in an arbitrary world. In this paper we will restrict our attention on one concrete world, which represents the game Tick-Tack-Toe. This world is a very simple one but it is sufficiently complicated for our task because most people cannot manage with it. The main difficulty in this world is that the player cannot see the entire internal state of the world so he has to build a model in order to understand the world. The model which we will offer will consist of final automata and first order formulas.