By Topic

Bitwise-Parallel Reduction for Connection Tests

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cameron Browne ; Department of Computing, Imperial College, London, U.K. ; Stephen Tavener

This paper introduces bitwise-parallel reduction (BPR), an efficient method for performing connection tests in hexagonal connection games such as Hex and Y. BPR is based on a known property of Y that games can be reduced to a single value indicating the fully connected player (if any) through a sequence of reduction operations. We adapt this process for bitwise-parallel implementation and demonstrate its benefit over a range of board sizes. BPR is by far the fastest known method if connection tests only need to be performed once per game, for example, to evaluate board fills following Monte Carlo playouts.

Published in:

IEEE Transactions on Computational Intelligence and AI in Games  (Volume:4 ,  Issue: 2 )