Bitwise-Parallel Reduction for Connection Tests


This paper introduces bitwise-parallel reduction (BPR), an economical technique for performing affiliation tests in hexagonal connection games like Hex and Y. BPR relies on a known property of Y that games will be reduced to one 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 profit over a range of board sizes. BPR is by far the fastest known technique if affiliation tests solely need to be performed once per game, for instance, to judge board fills following Monte Carlo playouts.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : PSR A Lightweight Proactive Source Routing Protocol For Mobile Ad Hoc Networks - 2014 ABSTRACT: Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking,
PROJECT TITLE : Network Resource Allocation for Users With Multiple Connections Fairness and Stability - 2014 ABSTRACT: This paper studies network resource allocation between users that manage multiple connections, possibly
PROJECT TITLE : Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks - 2014 ABSTRACT: This paper considers the problem of joint topologytransparent scheduling (TTS) and quality-of-service (QoS) routing in

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry