Especificação formal de jogos de inteligência artificial

• Autor(a) principal: Eliseu César Miguel
• Data de Publicação: 2004
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da UFMG
• Texto Completo: http://hdl.handle.net/1843/BUBD-9JWPHS
• topic: Ciência da computação; Linguagem de programação (Computadores); Inteligência artificial; Computação; Jogos por computador; Matemática Computação

Computer games are one of the oldest areas of research in Artificial Intelligence. Most people are interested in games just for fun, but they are relevant also for academic purposes. Some games are difficult to be solved. When writing programs that provide a solution for these games, it may be necessary to apply sophisticated Artificial Intelligence techniques. In order to produce correct solutions, it is important to understand exactly the rules of the game. But when a new game is proposed, it is not unusual to present its rules in natural language. This lack of formalizationmay result in difficulties for understanding correctly the rules. Abstract State Machines (ASM) are an expressive and elegant formalization method used in modelling dynamic discrete systems. With semantics rigorously defined, ASM have been applied succesfully on the formalization of several kind of systems. This work shows that ASM is an excellent alternative to give a clear and precise specification of the rules of computer games. Using ASM-based programming languages,examples of formalization of the behaviour of intelligent agents in computer games are presented.