Sciweavers

109 search results - page 1 / 22
» How to Win a Game with Features
Sort
View
CCL
1994
Springer
13 years 9 months ago
How to Win a Game with Features
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
Rolf Backofen, Ralf Treinen
JOT
2007
109views more  JOT 2007»
13 years 5 months ago
Introductory Game Programming Instruction with OOP - What is required, How is it addressed, and Which language wins?
: This paper analyzes three popular programming languages (Adobe/Macromedia Flash, Java and Visual Basic.net), used to teach introductory 2D game programming courses. Presented in ...
Lakshmi Prayaga
LICS
1997
IEEE
13 years 8 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
JCT
2007
85views more  JCT 2007»
13 years 5 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
FSTTCS
2007
Springer
13 years 11 months ago
A Theory for Game Theories
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
Michel Hirschowitz, André Hirschowitz, Tom ...