Sciweavers

2322 search results - page 4 / 465
» On a game in directed graphs
Sort
View
AAAI
2004
15 years 1 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
JCP
2007
118views more  JCP 2007»
14 years 11 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen
JCT
2007
95views more  JCT 2007»
14 years 11 months ago
Directed tree-width examples
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...
Isolde Adler
AAAI
2010
15 years 1 months ago
Fixing a Tournament
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
Virginia Vassilevska Williams
CORR
2007
Springer
84views Education» more  CORR 2007»
14 years 11 months ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale