Abstract- MTD algorithm developed by Plaat is a variation of SSS * which uses the depth-first strategy to resolve the storage problem coming from the best-first strategy. Since MTD algorithm is based on the zero window search algorithm, the initial range of the searching windows plays an important role in the performance. In this paper, we show some basic experimental results of MTD algorithm. From considerations of the results, the performance of MTD algorithm is expected to be improved by the reduction of the number of times that zero window procedure is called. Then we propose two variations of MTD algorithm. Our purpose is the reduction of searching nodes by the setting of initial window ranges and the way of narrowing the range in the search. Experimental results show 6 percents improvement of searching nodes against MTD-f algorithm. 1.

cognition and show that it cannot explain performance data from human players of the game-even when we relax the assumption of fully sequential processing. Standard models disregard many actions taken by players because they appear unmotivated or superfluous. How-ever, we show that such actions are actually

The Robot World Cup Initiative (RoboCup) is an attempt to foster AI and intelligent robotics research by providing a standard problem where wide range of technologies can be integrated and examined. In order for a robot team to actually perform a soccer game, various technologies must

We introduce a game-theoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hoc-VCG, a reactive

with a computer or game console. This paper describes research conducted to find out what the differences are between using actual and imagined movement as modalities in a BCI game. Results show that there are significant differences in user experience and that actual movement is a more robust way

the information pump enables customers to interact with each other in a web-based game that provides incentives for truth-telling and thinking hard, thus providing new ways for customers to verbalize the product features that are important to them. Fast polyhedral adaptive conjoint estimation enables PD teams

for larp experience design. Larp is actually a variety of different forms and styles. It may consist of only a few players or hundreds of players playing at the same time. It may be situated in a room indoors or in a field or forest outdoors. It may be played with physical or symbolic combat or no combat

This is an extended write-up of a lecture introducing the concept of Nash equilibrium in the context of an auction-type game which one can observe being played by “ordinary people ” in real time. In a simplified model we give an explicit formula for the Nash equilibrium. The actual game is more

they played successively the dictator game, the ultimatum game, and finally the combination of the former two, originally studied by Güth and van Damme (1998). A final personality questionnaire elicits self-evaluations concerning ethical constraints, attitude towards risk, and analytic capability in addition

Despite general awareness of the importance of keeping one’s system secure, and widespread availability of consumer security technologies, actual investment in security remains highly variable across the Internet population, allowing attacks such as distributed denialof-service (DDoS) and spam