Back to Results
First PageMeta Content
Binary arithmetic / Video board games / Hex / Connection game / Y / Bitwise operation / Zillions of Games / Bitboard / Star / Games / Abstract strategy games / Board games


IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 3, NO. 1, MARCH[removed]Bitwise-Parallel Reduction for Connection Tests Cameron Browne, Member, IEEE, Stephen Tavener
Add to Reading List

Document Date: 2012-06-14 18:26:01

Open Document

File Size: 492,18 KB

Share Result on Facebook

City

Island / Edmonton / Brisbane / Boston / Natick / London / /

Company

GPU / M. L. Psiaki S. P. / Zillions of Games / NEO Press / The times / BBC / /

Country

Australia / United Kingdom / Finland / Spain / /

/

Facility

Westfield College / Imperial College / /

IndustryTerm

by-product / elegant algorithm / tree search / bitwise-parallel breadth-first search / retail shop / tree search approaches / i5 processor / Wireless Commun / union find search / win test algorithm / technology / win test algorithms / /

Organization

Department of Computing / Imperial College / Queen Mary and Westfield College / London / /

Person

John Nash / G. M. Adelson-Velskiy / V / Piet Hein / Ryan Hayward / Stephen Tavener / Addison Wesley / Cameron Browne / Greg Schmidt / Steven Meyers / Claude Shannon / /

/

Position

editor / fully-connected player / game designer / player / Dean / author / Professor / specified player / /

ProgrammingLanguage

Java / R / /

ProvinceOrState

Alberta / Maine / Massachusetts / /

Technology

UF algorithms / 4.5 Non-Destructive BPR The BPR algorithm / basic BPR algorithm / non-destructive BPR algorithm / GPS / i5 processor / BPR algorithm / artificial intelligence / elegant algorithm / Java / 0 BPR Algorithm / win test algorithms / caching / simulation / win test algorithm / /

URL

http /

SocialTag