Stronger Virtual Connections in Hex

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving 7 7 Hex: Virtual Connections and Game-state Reduction

We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...

متن کامل

Solving 7x7 Hex: Virtual Connections and Game-State Reduction

We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...

متن کامل

Hex Player - A Virtual Musical Controller

In this paper, we describe a playable musical interface for tablets and multi-touch tables. The interface is a generalized keyboard, inspired by the Thummer, and consists of an array of virtual buttons. On a generalized keyboard, any given interval always has the same shape (and therefore fingering); furthermore, the fingering is consistent over a broad range of tunings. Compared to a physical ...

متن کامل

Scheduling of Virtual Connections in Fast Networks

In communication networks based on ATM it is necessary to allocate suucient resources whenever a new connection is established. In particular, a certain amount of bandwidth must be reserved along a path between sender and receiver. Several virtual connections can share a physical link if the sum of their bandwidths does not exceed the link capacity. Given a network and a set of connection reque...

متن کامل

Routing Multipoint Connections Using Virtual Paths in an ATM Network

We study the point-to-multipoint routing problem in an ATM network that uses Virtual Paths (VP's). In multicast, a source node wishes to transmit the same packets to a number of destination nodes. The destination nodes send return messages to the source and packets from diierent nodes are not the same. We consider ATM networks with asymmetric and symmetric VP's and the performance factors studi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computational Intelligence and AI in Games

سال: 2015

ISSN: 1943-068X,1943-0698

DOI: 10.1109/tciaig.2014.2345398