2

We present a new method for taking advantage of the relative independence between parts of a single-player game. We describe an implementation for improving the search in a solitaire card game called Gaps. Considering the basic techniques, we show that a simple variant of Gaps can be solved by a straightforward depth-first search (DFS); turning to variants with a larger search space, we give an...

Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...

An experimental evaluation of a technique for improving the efficiency of depth-first search on graphs is presented. The technique, referred to as cycle checking, prevents the generation of duplicate nodes in the depth-first search of a graph by comparing each newly generated node to the nodes already on the search path. Although cycle checking can be applied to any depth-first type search, thi...

The design of educational software interfaces is a complex task, given its high domain dependency and multidisciplinary nature. It requires that teachers’ knowledge and pedagogical beliefs be incorporated into the interface, posing a challenge to both teachers and designers, as they have to act as partners from the earliest phases of the process, sharing their knowledge. The present work invest...

We consider communication situations games being the combination of a TU-game and a communication graph. We study the average tree (AT) solutions introduced by Herings et al. [9] and [10]. The AT solutions are defined with respect to a set, say T , of rooted spanning trees of the communication graph. We characterize these solutions by efficiency, linearity and an axiom of T -hierarchy. Then we ...

The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the question “Where is X”. Breadth-first search, the basic searching mechanism used in Gnutella networks [7], floods the networks to maximize the return results. Depth-first search used in Freenet [6] retrieves popular files...

Multiview video in “texture-plus-depth” format enables decoder to synthesize freely chosen intermediate views for enhanced visual experience. Nevertheless, transmission of multiple texture and depth maps over bandwidthconstrained and loss-prone networks is challenging, especially for conferencing applications with stringent deadlines. In this paper, we examine the problem of loss-resilient codi...

This article has three main contributions to our understanding of minimax search: First, a new formulation for Stockman’s SSS* algorithm, based on AlphaBeta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = Alpha-Beta + transposition tables. The crucial step is the realization that transposition table...