Search results

...Metropolis] (ed.) ''[http://dl.acm.org/citation.cfm?id=578384 A History of Computing in the Twentieth Century]''. [https://en.wikipedia.org/wiki/Academic_Press * Bitboards can operate on all squares in parallel using bitwise instructions. This is one of the main arguments used by propo

...rch|parallel search]] <ref>Robert Hyatt ('''1988'''). ''A High-Performance Parallel Algorithm to Search Depth-First Game Trees''. Ph.D. Thesis, Department of C ...e [[WCCC 1983]] and the [[WCCC 1986]]. Beside research and publications on parallel search, [[Transposition Table|transposition table]], [[Time Management|time

* [[ACM]] - Association for Computing Machinery * [[Parallel Search#PrincipalVariationSplitting|PVS]] - Principal Variation '''Splitting

* [[Parallel Computing]] * [[Parallel Prefix Algorithms]]

* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]] * [[Parallel Search]]

...home] kind of [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing]. * [[Parallel Search]] using [[Thread|Threads]]

...who could not understand them, "brute force"), considering of a course in parallel with the opponent, debut help on the basis of databases, not trivial algori ...nal advantages of one of the sides. Each chess program has a procedure for computing the evaluation function. When all the leaf positions are evaluated one can

...omb_project Bomb], how were you able to perform such an enormous amount of computing with your weak computers?". The Russian responded: "We used better algorith ...ople, and succeeded. The teams continued to grow and work on the theory of computing.

==Parallel== ...org/comp-hist/BRL61.html#TOC A Third Survey of Domestic Electronic Digital Computing Systems]''. Report No. 1115

...used eight [[Nova|Data General]] computers with each screen displaying the parallel computations taking place <ref>[http://www.computerhistory.org/chess/full_r [[ACM 1982]], Parallel Computer Chess Machine Ostrich <ref>[http://www.computerhistory.org/chess/f

...<ref>Editor ('''1979'''). ''Will Blitz be next year's champ?'' [[Personal Computing]], Vol. 3, No. 7, pp. 80, July 1979</ref> ...<ref>[[Chrilly Donninger]], [[Alex Kure]], [[Ulf Lorenz]] ('''2004'''). ''Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program''. [http://dl

...ocessor <ref>[https://en.wikipedia.org/wiki/Thread_%28computing%29 Thread (computing) from Wikipedia]</ref> ]] Chess programs using threads for a [[Parallel Search|parallel search]] have to deal with synchronization issues, if multiple threads read

=Parallel Search= In [[Parallel Search#ThreadsVsProcesses|Parallel search]], multiple [[Thread|threads]] within one process are more common, b

...]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-a ...t Architectures''. in IEEE 10th Conference in High Performance Distributed Computing, August 2001

...nd [[CilkChess]] <ref>[http://supertech.csail.mit.edu/chess/ The Cilkchess Parallel Chess Program]</ref> as prominent samples. ...>, where a structure of stacked linear evaluation functions was trained by computing a correlation measure based on the number of times the feature rated an alt

...] ('''1979'''). ''Background on BB-1''. [[Personal Computing#3_11|Personal Computing, Vol. 3, No. 11]], pp. 80</ref>, and was ported to run on a ''SYS-10'' comp ...ration]]. The actual unit is divided into two processors which function in parallel: one that finds pieces and one that calculate and stores moves. This parall

...MyChess-CSC Confrontation at San Jose''. [[Personal Computing#5_1|Personal Computing, Vol. 5, No. 1]], pp. 79-81</ref>. ...omputer Chess Championship]], Fidelity showed up with a huge experimental, parallel machine, named ''Chess Challenger X''. Authors were [[Ron Nelson]], [[Dan S

...ref>[http://www.craftychess.com/hyatt/search.html The DTS high-performance parallel tree search algorithm] by [[Robert Hyatt]]</ref>, specifically designed for ...'). ''The Cray-1 Plays Chess (Part 1)''. [[Personal Computing#5_1|Personal Computing, Vol. 5, No. 1]], pp. 83

...gamon_Press Pergamon Press], [http://www.amazon.com/Elements-combinatorial-computing-Mark-Wells/dp/B0000EG7JI amazon.com] ...d Monien]], [[Ewald Speckenmeyer]] ('''1986'''). ''Superlinear Speedup for Parallel Backtracking.'' Technical Report 30, [[Paderborn University]]

...ulations_by_Fast_Computing_Machines Equation of State Calculations by Fast Computing Machines]''. [https://en.wikipedia.org/wiki/Journal_of_Chemical_Physics Jou ...ulations_by_Fast_Computing_Machines Equation of State Calculations by Fast Computing Machines]''. [https://en.wikipedia.org/wiki/Journal_of_Chemical_Physics Jou

...[[Marius Olafsson]] helped with the implementation of a [[Parallel Search|parallel search]]. Phoenix and Sun Phoenix participated at four [[World Computer Che ...ome tactical hints <ref>[[Jonathan Schaeffer]] ('''1987'''). ''Speculative Computing''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]</ref>.

=Parallel Search= * [[Parallel Search]]

* [[Parallel Search#ParallelAlphaBeta|Parallel Alpha-Beta]] : [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta in Cilk]]

...ng] from the [http://www.netlib.org/utk/lsi/pcwLSI/text/BOOK.html Parallel Computing Works] ebook</ref> ]] ...Vol. 7, No. 4, pp. 442-452. [http://webdocs.cs.ualberta.ca/~tony/OldPapers/parallel.pdf 1984 pdf] (Draft)</ref>.

...n/sitewise.pl?act=det&p=10719 Faster Than Thought], a symposium on digital computing machines, reprinted 1988 in [[Computer Chess Compendium]], reprinted in ...peland] (editor) ('''2004'''). ''The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The S

...allel Alpha-Beta Search on Arachne.'' [[IEEE]] International Conference on Parallel Processing, pp. 235-243.</ref> <ref>[https://www.stmintz.com/ccc/index.php? ...allel Alpha-Beta Search on Arachne.'' [[IEEE]] International Conference on Parallel Processing

...''). ''Parallel Search of Strongly Ordered Game Trees.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 14, No. 4, [http://www.cs.ualberta.ca/%7Etony/OldPapers/str ...('''1980'''). ''Parallel Search of Game Trees.'' Technical Report TR 80-7, Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta

...'Experiments in Selective Search Extensions''. M.Sc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public ...ome tactical hints <ref>[[Jonathan Schaeffer]] ('''1987'''). ''Speculative Computing''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]</ref>.

...allel Alpha-Beta Search on Arachne.'' [[IEEE]] International Conference on Parallel Processing, pp. 235-243</ref> , in Fishburn's 1981 Thesis <ref>[[John Phili * [[Parallel Search]]

...tricht University]], since September 2008 at ''Tilburg Centre for Creative Computing (TiCC)'' and ''Tilburg School of Humanities'' at [[Tilburg University]], [h ...Opponent-Model Search in Bao''. International Conference on Entertainment Computing - ICEC 2004. LNCS 3166, Springer. [http://www.fdg.unimaas.nl/educ/donkers/p

...Metropolis] (ed.) ''[http://dl.acm.org/citation.cfm?id=578384 A History of Computing in the Twentieth Century]''. [https://en.wikipedia.org/wiki/Academic_Press ...ware|software]]. Bitwise boolean operations on 64-bit words are in fact 64 parallel operations on each [[Bit|bit]] performing one setwise operation without any

* [[Alex Bell]] ('''1972'''). ''[http://www.chilton-computing.org.uk/acl/literature/books/gamesplaying/overview.htm Games Playing with Co ...''Experiments in Selective Search Extensions''. MSc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public

...f smaller than byte-entities are processed in [[Parallel Prefix Algorithms|parallel prefix]] manner. Amazing, how similar these two SWAR- and [[Parallel Prefix Algorithms|parallel prefix wise]] routines are. [[Flipping Mirroring and Rotating#MirrorHorizon

* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]] ...n and stacks in BASIC)]''. [[Creative Computing#Best3|The Best of Creative Computing Volume 3]] » [[Basic]]

'''[[Main Page|Home]] * [[Search]] * Parallel Search''' ...6903306|Parallel scalability <ref>[http://www.drdobbs.com/high-performance-computing/206903306 Super Linearity and the Bigger Machine] from [http://www.drdobbs.

...tion to the table overflow problem for Hash Tables]''. [http://www.chilton-computing.org.uk/acl/literature/reports/overview.htm Literature: Reports] hosted by [ ...ic hash method when the table size is a power of 2]''. [http://www.chilton-computing.org.uk/acl/literature/reports/overview.htm Literature: Reports] hosted by [

...a simple [https://en.wikipedia.org/wiki/Relay relay] (K1) with its contact parallel to the On-push-button S2, "remembers" whether last action was pushing S1 (r ...arrays]] of one-bit latches or flip-flops typically as wide as a connected parallel [https://en.wikipedia.org/wiki/Bus_%28computing%29 data-bus]. They may be u

...''1989'''). ''Control Strategies for Two-Player Games.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 21, No. 2 ...ro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2009'''). ''Scalable, Parallel Best-First Search for Optimal Sequential Planning''. In Proceedings of the

Typically the probe process requires some computing and it may access storage and decompress which is usually so slow. An engin * [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report #88-014, Boston University

...hn Romein]], [[Henri Bal]] ('''2003'''). ''Solving the Game of Awari using Parallel Retrograde Analysis''. IEEE Computer, Vol. 36, No. 10</ref>. The first retr * [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report #88-014, Boston University

...ady give "divided" output for Perft. Below is output of [[Stockfish]] when computing perft 5 for start position: * [[Aart Bik]] ('''2012'''). ''Computing Deep Perft and Divide Numbers for Checkers''. [[ICGA Journal#35_4|ICGA Jour

'''[[Main Page|Home]] * [[Search]] * [[Parallel Search]] * Dynamic Tree Splitting''' ...ref>[http://www.craftychess.com/hyatt/search.html The DTS high-performance parallel tree search algorithm] by [[Robert Hyatt]]</ref> .

'''[[Main Page|Home]] * [[Search]] * [[Parallel Search]] * Young Brothers Wait Concept''' ...the oldest brother is searched first, younger brothers, to be searched in parallel, have to wait until the oldest brother did not yield in a [[Beta-Cutoff|bet

'''[[Main Page|Home]] * [[Search]] * [[Parallel Search]] * Jamboree''' ...MD Computing'' <ref>[[Bradley Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science

...rg/wiki/Multithreading_%28computer_architecture%29 multithreaded] parallel computing. Cilk started as in the mid 90s as a project at the Supertech research grou =Parallel Chess=

a parallel chess program, developed by a team from [[Massachusetts Institute of Techno =Massively Parallel Chess=

...dley Kuszmaul|Bradley C. Kuszmaul]] ('''1995'''). ''The StarTech Massively Parallel Chess Program''. [[ICGA Journal#18_1|ICCA Journal, Vol. 18, No. 1]], [http: ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science

* [[Ting-Han Wei]], [[I-Chen Wu]], ''A Special Issue on Job-level Computing''. ...ito Hoki]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]], ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. <ref>

...to be loaded into six identical hardware units computing pawn structure in parallel.

...ir duration, the todays de facto standard in measuring playing strength is parallel playing [https://en.wikipedia.org/wiki/Fast_chess fast chess] with (ultra) ...'). ''On the Grading of Chess Players''. [[Personal Computing#3_3|Personal Computing, Vol. 3, No. 3]], pp. 47

...onsidered as a move, "9 156 1084 48000 Nf3 Nc6 Nc3 Nf6" is considered as a computing output when the first number is the ply, the second number is a score in ce ...ines, take note!] by [[Harm Geert Muller]], [[CCC]], October 11, 2008 » [[Parallel Search]], [[SMP]]

...ock code, just for you] by [[Steven Edwards]], [[CCC]], June 01, 2011 » [[Parallel Search]] * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=44808 Computing from the Old Days, brought back to life] by [[Steven Edwards]], [[CCC]], Au

...hard Gerhard Wellein] ('''2013'''). ''The Practitioner's Cookbook for Good Parallel Performance on Multi- and Many-Core Systems''. [https://de.wikipedia.org/wi ...04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]]

* [[Parallel Search]] ...el/parallel/docs/dac98.pdf pdf] <ref>[http://www.eecg.toronto.edu/parallel/parallel/numadocs.html Documentation on the NUMAchine Multiprocessor]</ref>

...ss Engines''. CONCIBE SCIENCE 2008, [http://www.micai.org/rcs/ Research in Computing Science]: Special Issue in Electronics and Biomedical Engineering, Computer ...a Reinforcement Learning Approach''. In 8th [[IEEE]] Symposium on Cluster Computing and the Grid. Lyon, [http://hal.inria.fr/docs/00/28/78/26/PDF/RLccg08.pdf p

...ence Learning''' <ref>[http://supertech.csail.mit.edu/chess/ The Cilkchess Parallel Chess Program]</ref>, which automatically adjusts α and λ <ref>[[Don Beal ...ma.html Computational Intelligence in Games, Studies in Fuzziness and Soft Computing]. [http://www.springer.com/economics?SGWID=1-165-6-73481-0 Physica-Verlag],

* [[Gerald Tesauro]], [[Terrence J. Sejnowski]] ('''1989'''). ''A Parallel Network that Learns to Play Backgammon''. [https://en.wikipedia.org/wiki/Ar ...ectures]''. [https://www.journals.elsevier.com/parallel-computing Parallel Computing], Vol. 14, No. 3

...abstract).'' Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective, p. 271, Denver, Colorado. ISBN 0-89791-170-9. ...t translating to SMP] by [[Andrew Grant]], [[CCC]], December 23, 2017 » [[Parallel Search]]

* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]] ('''1988'''). ''Parallel Algorithmic Techniques for Combinatorial Computation''. [https://dblp.uni-t ...iangulation''. [https://www.worldscientific.com/worldscibooks/10.1142/2463 Computing in Euclidean Geometry (2nd ed)], [https://www.ics.uci.edu/~eppstein/pubs/Be

...hara]], [[Yasuhiro Tajima]], [[Yoshiyuki Kotani]] ('''2007'''). ''Multiple Parallel Search in Shogi''. [[Conferences#GPW|12th Game Programming Workshop]] .... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 3, No. 3

...Yen]], [[Jung-Kuei Yang]] ('''2009'''). ''The Bitboard Design and Bitwise Computing in Connect Six''. [[Conferences#GPW|14th Game Programming Workshop]] ...('''2012'''). ''[http://ieeexplore.ieee.org/document/6337852/ A Node-based Parallel Game Tree Algorithm Using GPUs]''. CLUSTER 2012, [https://pdfs.semanticscho

.../acl/literature/reports/p019.htm The Mystery of Go]''. [http://www.chilton-computing.org.uk/acl/literature/reports/overview.htm Literature: Reports] hosted by [ ...('''1979'''). ''Computer GO Has Come''. [[Personal Computing#3_5|Personal Computing, Vol. 3, No. 5]], pp. 55

...wdoc/summary?doi=10.1.1.39.3189 CiteSeerX]</ref> and for [[Parallel Search|parallel search]] on [[ABDADA]] <ref>[[Jean-Christophe Weill]] ('''1996'''). ''[http ...arch Library]</ref> <ref>[[Mark Brockington]] ('''1998'''). ''Asynchronous Parallel Game-Tree Search''. Ph.D. Thesis, [[University of Alberta]], [http://games.

...r ('''1979'''). ''Computer Backgammon''. [[Personal Computing#3_8|Personal Computing, Vol. 3, No. 8]], pp. 81 * [[Gerald Tesauro]], [[Terrence J. Sejnowski]] ('''1989'''). ''A Parallel Network that Learns to Play Backgammon''. [https://en.wikipedia.org/wiki/Ar

...''). ''A General Game Playing Program''. [[Personal Computing#3_6|Personal Computing, Vol. 3, No. 6]], pp. 70 ...Feature Learning using State Differences''. Master's thesis, Department of Computing Science, [[University of Alberta]], [http://repository.library.ualberta.ca/

...'''1993'''). ''[http://www.pubzone.org/dblp/conf/parco/KontoghiorghesC93 A Parallel Algorithm for Repeated Processing Estimation of Linear Models with Equality ...e]] ('''1993'''). ''[http://www.springerlink.com/content/f37823284hh143jl/ Computing the Complete Orthogonal Decomposition Using a SIMD Array Processor]''. [htt

...ef> <ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems'' Phd-Thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/ ...ck again''. P2P2004, The 4th IEEE International Conference on Peer-to-Peer Computing, [http://www.ida.liu.se/conferences/p2p/p2p2004/papers/datta.pdf pdf]

...ased on [https://en.wikipedia.org/wiki/ANSI_C ANSI C] and co-author of the parallel chess programs [[StarTech]], [[Star Socrates]] and [[Cilkchess]] <ref>[http ...ilk Arts, Inc.'', a start-up developing [[Cilk]] technology for multi-core computing applications, which was acquired by [[Intel]] in August 2009 <ref>[http://w

...iness, Don Dailey started to work for Charles at the lab at MIT on the new parallel program [[Star Socrates|*Socrates]] part time, beside his duty as official ...pher F. Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. Thesis, Department of Electrical Engineering and Computer Science,

...long with [[Fred Popowich]], Tony is further co-author of the experimental parallel chess program [[Parabelle]], and with [[Chun Ye]] co-author of the [[Chines ...is primary teaching and research interests were in the area of distributed computing systems design.

...'). ''On the Grading of Chess Players''. [[Personal Computing#3_3|Personal Computing, Vol. 3, No. 3]], pp. 47 ...'1979'''). ''Practical Rating Program''. [[Personal Computing#3_9|Personal Computing, Vol. 3, No. 9]], pp. 62 » [[#Bloss|Bloss]]

==Transactions on Affective Computing== * [https://www.computer.org/web/tac Transactions on Affective Computing]

...David vs. 12 Goliaths]''. [[Creative Computing#Best2|The Best of Creative Computing Volume 2]], edited by [https://en.wikipedia.org/wiki/David_H._Ahl David Ahl ...ter Chess Championship]''. [[Creative Computing#Best2|The Best of Creative Computing Volume 2]], edited by [https://en.wikipedia.org/wiki/David_H._Ahl David Ahl

...len_%26_Unwin Allen & Unwin], ISBN-13: 978-0080212227, [http://www.chilton-computing.org.uk/acl/literature/books/gamesplaying/p003.htm Chapter 3: Board Games] * [[Alan H. Bond]] ('''1987'''). ''Broadcasting Arrays - A Highly Parallel Computer Architecture Suitable For Easy Fabrication''. [http://www.exso.com

...]], Vol. 4, No. 3</ref> he already proposed a [[Parallel Prefix Algorithms|parallel prefix]] [[Flipping Mirroring and Rotating#Rotationby180degrees|bit reversa ...c.uk/Fellows-and-Staff-Directory/dfh1/ David Hartley], [http://www.chilton-computing.org.uk/acl/technology/atlas/p021.htm Eric Nixon], [[Christopher Strachey]]

* [https://en.wikipedia.org/wiki/Parallel_projection Parallel projection from Wikipedia] ...ssforeva.wordpress.com/2010/06/26/3d-chess-computing-for-browser/ 3D chess computing for browser « Chessforeva's Blog]

...al. attending, and mentioned computer chess as one application of parallel computing <ref>[http://www.computerwoche.de/a/gmd-absehied-von-der-hardware-forschung ..., [[Elmar Henne]] and [[Wolfram Wolff]] - [[Parwell]], which performed a [[Parallel Search|distributed search]] and played the [[ECCC 1979|Second European Comp

...clude computer games, [https://en.wikipedia.org/wiki/Cloud_computing cloud computing], [https://en.wikipedia.org/wiki/Peer-to-peer Peer-to-peer] for gaming, and * [[I-Chen Wu]] ('''1993'''). ''Multilist Scheduling: A New Parallel Programming Model''. Ph.D. thesis, [[Carnegie Mellon University]], advisor

...rg/wiki/Distributed_computing distributed computing] and [[Parallel Search|parallel search]]. Along with [[Yasushi Tanase]], and at times [[Ayumu Nagai]] and [ .../~games/ The University of Alberta GAMES Group]</ref> in the Department of Computing Science at the [[University of Alberta]], and worked with [[Jonathan Schaef

a Canadian computer games researcher, professor in computing science and dean of science at [[University of Alberta]], [https://en.wikip Beside research on [[Games|games]], search algorithms and [[Parallel Search|parallel search]], Jonathan Schaeffer is best known as primary author of the World M

* [[Gerald Tesauro]], [[Terrence J. Sejnowski]] ('''1989'''). ''A Parallel Network that Learns to Play Backgammon''. [https://en.wikipedia.org/wiki/Ar ...trier.de/~ley/db/journals/internet/internet11.html#Tesauro07 IEEE Internet Computing Vol. 11]

a Canadian mathematician, computer scientist, and professor at Department of Computing Science at [[University of Alberta]]. Ryan Hayward is particularly interest * [[Jakub Pawlewicz]], [[Ryan Hayward]] ('''2013'''). ''Scalable Parallel DFPN Search''. [[CG 2013]]

...tion-Table-Driven Scheduling in Distributed Search''. IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 5, pp. 447–459. [http://www.cs.vu.n .... [http://www.journals.elsevier.com/entertainment-computing/ Entertainment Computing], Vol. 5, No. 3, [http://askeplaat.files.wordpress.com/2013/01/the-applicat

...Vermaseren]] ('''1991'''). ''Symbolic manipulation with FORM''. A note on computing the regular solutions of linear differential systems ...04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]

...//pc2.uni-paderborn.de/ Welcome to PC², the Paderborn Center for Parallel Computing]

...ref><ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems'' Phd-Thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/ ...rallel game tree search algorithm which runs efficiently even on massively parallel systems without any shared memory.

...Systems'' <ref>Feldmann, R. ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/moni * [[Parallel Search]]

...eered in using [[Rotated Bitboards|Rotated bitboards]] , [[Parallel Search|parallel search]] and probing [[Nalimov Tablebases]]. It performs a [[Principal Vari * This version contains a major rewrite of the [[Parallel Search|parallel search]] code, now referred to as '''Generation II'''. It has a more lightw

* [[Rémi Coulom]] ('''2007'''). ''[http://remi.coulom.free.fr/Amsterdam2007/ Computing Elo Ratings of Move Patterns in the Game of Go]''. [[CGW 2007]] * [[Rémi Coulom]] ('''2007'''). ''Computing Elo Ratings of Move Patterns in the Game of Go''. [[ICGA Journal#30_4|ICGA

...game-tree search]] and [https://en.wikipedia.org/wiki/Grid_computing Grid computing] <ref>[http://www.informatik.uni-hamburg.de/TIS/index.php/de/projekte/phd-p ...German) <ref>[[Dap Hartmann]] ('''2013'''). ''Optimistically Parallelizing Parallel Search Processes''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]], Rev

.../Deutscher_Hochschulverband Deutscher Hochschulverband (DHV)] and Chair of Parallel and Distributed Systems at the [https://en.wikipedia.org/wiki/Humboldt_Uni * [[Alexander Reinefeld]] ('''2000'''). ''Parallel Heuristic Search'' and ''Heuristic Search''. In: [http://titan.princeton.ed

...ss] from the [http://www.netlib.org/utk/lsi/pcwLSI/text/BOOK.html Parallel Computing Works] ebook * [http://www.chilton-computing.org.uk/acl/literature/books/gamesplaying/overview.htm Games Playing with Co

...n and stacks in BASIC)]''. [[Creative Computing#Best3|The Best of Creative Computing Volume 3]] » [[Basic]] * [http://www.talkchess.com/forum/viewtopic.php?t=40493 LIFO stack based parallel processing?] by [[Srdja Matovic]], [[CCC]], September 22, 2011

...earch|search algorithms]]. He created the [[Conspiracy Number Search#PCCNS|Parallel Controlled Conspiracy Number Search]] algorithm, topic of his Ph.D. thesis * [[Ulf Lorenz]], [[Valentin Rottmann]] ('''1997'''). ''Parallel Controlled Conspiracy-Number Search.'' [[Advances in Computer Chess 8]]

...umber Search]] <ref> [[Ulf Lorenz]], [[Valentin Rottmann]] ('''1996'''). ''Parallel Controlled Conspiracy-Number Search''. [[Advances in Computer Chess 8]]</re ...ut not least, only a best move is computed and no resources are wasted for computing an upper bound for the value of this move. All chess specific knowledge use

...n University]], and head of the research group AG Monien: Efficient Use of Parallel and Distributed Systems. ...Mysliwietz]], [[Ulf Lorenz]] and [[Valentin Rottmann]] were authors of the parallel chess programs [[Zugzwang (Program)|Zugzwang]], [[Ulysses]], [[Cheiron]] an

...in the field of [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] concerning [[Memory#Shared|shared memory]] and [[Memory#Cache|cache]] [htt

...in the field of [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] concerning [[Memory#Shared|shared memory]] and [[Memory#Cache|cache]] [htt

...en.wikipedia.org/wiki/Database_design Database Design], and sequential and parallel [[Algorithms|Algorithm Design]]. .... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol 2, No. 1

...lgorithms|algorithms]], [https://en.wikipedia.org/wiki/Parallel_processing parallel processing], [https://en.wikipedia.org/wiki/Real-time_computing real-time s ...ng Chen]], [[Shun-Shii Lin]], [[Min-Huei Huang]] ('''2012'''). ''Volunteer Computing System Applied to Computer Games''. [[TCGA 2012|TCGA 2012 Workshop]], [http

...Homepage]</ref> . His research interests covers distributed algorithms, [[Parallel Search]] as well as [[Chinese Chess|Computer Chinese Chess]]. ...lo] ('''2001'''). ''An atomic model for message passing'', SIAM Journal on Computing, vol. 31(1), pp. 67-85, [http://www.csie.ntu.edu.tw/~pangfeng/papers/SIAM%2

...'Experiments in Selective Search Extensions''. M.Sc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public ...abelle: Experience with a Parallel Chess Program.'' Technical Report 83-7. Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta

...sible computing]. His primary contributions include his work on reversible computing and [https://en.wikipedia.org/wiki/Cellular_automaton cellular automaton]. * [[Deep Blue]], a parallel supercomputer that processes an average of 200 million chess positions per

...abstract).'' Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective ...('''1989'''). ''A Parallel Alpha-Beta Tree Searching Algorithm''. Parallel Computing, Vol. 10, No. 3

...'s main improvement over the Cray-1 was a [[Memory#Shared|shared-memory]], parallel [https://en.wikipedia.org/wiki/Vector_processor vector processor], housing ...er.de/db/journals/jpdc/jpdc1.html#ChenDH84 Journal of Parallel Distributed Computing], Vol. 1, No. 2, [http://www.netlib.org/utk/people/JackDongarra/PAPERS/009_

...</ref> . As postdoc at Queen's University he published various papers on [[Parallel Search]]. ...a superposition of two or more pieces <ref>[http://research.cs.queensu.ca/Parallel/QuantumChess/QuantumChess.html Quantum Chess]</ref>.

...Logic Systems], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] along with [[NUMA]], and [[FPGA]]. Along with Stephen Brown <ref>[http://w ...nko Vranesic]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/3172/ Parallel standard cell placement algorithms with quality equivalent to simulated ann

...<ref>[[Chrilly Donninger]], [[Alex Kure]], [[Ulf Lorenz]] ('''2004'''). ''Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program''. [http://dl * [[Chrilly Donninger]], [[Alex Kure]], [[Ulf Lorenz]] ('''2004'''). ''Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program''. [http://dl

...ning|machine learning]] experience in the domain of Go, after removing the parallel portion of the code, the project evolved to an [[UCI]] compliant [[:Categor

...the current release with Jonathan Rosenthal as sole author has removed the parallel portion of the code <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66

...exhaustive search]], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computation] <ref>[http://www.jn.inf.ethz.ch/research.html Prof. Jürg Niev ...for programming as part of general education]''. Symposia on Human-Centric Computing Languages and Environments

...cal_cyclone hurricane] simulations. His research includes high performance computing, and the use of [[Neural Networks|artificial neural networks]] for [https:/ ...l search on SMP system] by [[Daniel Shawul]], [[CCC]], March 07, 2013 » [[Parallel Search]] <ref>[https://en.wikipedia.org/wiki/Message_Passing_Interface Mess

...retrograde analysis]] <ref>[[Henri Bal]], [[Victor Allis]] ('''1995'''). ''Parallel Retrograde Analysis on a Distributed System''. Supercomputing ’95, San Di * [[Henri Bal]], [[Robbert van Renesse]] ('''1986'''). ''Parallel Alpha-Beta Search''. 4th NGI-SION Symposium Stimulerende Informatica

...rch]] and [https://en.wikipedia.org/wiki/Distributed_computing distributed computing]. In 2002, along with [[Henri Bal]], he solved the game of [[Awari]] <ref>[ * [[John Romein]], [[Henri Bal]] ('''1995'''). ''Parallel N-Body Simulation on a Large-Scale Homogeneous Distributed System''. [http:

...Andrew Tridgell]] <ref>[[Andrew Tridgell]] ('''1997'''). ''KnightCap — a parallel chess program on the AP1000+''.</ref>, [[Jonathan Baxter]] and [[Lex Weaver ...m performs a [[Iterative Deepening|iterative deepening]] [[Parallel Search|parallel]] [[MTD(f)]] search utilizing the [[Shared Hash Table|shared transposition

...trier.de/db/journals/ijhsc/ijhsc7.html International Journal of High Speed Computing, Vol. 7], No. 2, [https://maths-people.anu.edu.au/~brent/pd/rpb158.pdf pdf] * [[Andrew Tridgell]] ('''1997'''). ''KnightCap — a parallel chess program on the AP1000+''. [http://ftp.riken.jp/pub/net/samba/tridge/k

...dia.org/wiki/Parallel_computing parallel computing], and [[Parallel Search|parallel search]]. ...d Monien]], [[Ewald Speckenmeyer]] ('''1986'''). ''Superlinear Speedup for Parallel Backtracking.'' Technical Report 30, [[Paderborn University]]

...ef> and contributors. It has gained widespread use in most every aspect of computing technology. Linux's support for consumer grade [[Engines|chess engines]] an ...eaded Runtime System on Linux''. Proc. 4th Workshop on Runtime Systems for Parallel Programming (RTSPP~'00), [http://www-id.imag.fr/%7Edanjean/publis/DanNamRus

...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science ...-of-parallel-and-distributed-computing Journal of Parallel and Distributed Computing], Vol. 33, No. 2

a massively [[Parallel Search|parallel]] chess program by [[Marc-François Baudot]], [[Jean-Christophe Weill]], [[ ...9_de_France Electrique de France] (EDF)" as a research project on parallel computing.

...ssor board <ref>Processor board of a CRAY T3E-136/ac (=air-cooled) massive parallel computer (operational ca. 1997-2005). The related system had 136 processors ...https://en.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel] [https://en.wikipedia.org/wiki/Supercomputer supercomputer] architecture,

...mbinatorial Logic#ALU|ALUs]], [[SIMD and SWAR Techniques|SIMD]] units with parallel shift and multiply, and [[Population Count|population count]] unit.

...od'' <ref>[[Gary Lindstrom]] ('''1983'''). ''The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm''. Technical Report UUCCS 83-101, [https://en.wikipedi ...-trier.de/db/journals/ijpp/ijpp3.html#Lindstrom74 International Journal of Parallel Programming], Vol. 3, No. 3

...sentation]], and applies a sophisticated distributed and [[Parallel Search|parallel search]]. Jonny played all [[World Computer Chess Championship|World Comput ...ry.php?news_id=2172 'btrzx3' inaugurated at German university - Scientific Computing World], July 08, 2013</ref> <ref>[http://www.hpc.uni-bayreuth.de/btrzx3/ind

...y] ('''1997'''). ''[http://www.thearling.com/text/evpar/evpar.htm Evolving Parallel Computation]''. [https://en.wikipedia.org/wiki/Complex_Systems_%28journal%2 * [[Aguston E. Eiben]], [[Marc Schoenauer]] ('''2005'''). ''Evolutionary Computing''. [https://arxiv.org/abs/cs/0511004 arXiv:cs/0511004]

'''[[Main Page|Home]] * [[Search]] * [[Parallel Search]] * APHID''' '''APHID''', (Asynchronous Parallel Hierarchical Iterative Deepening)<br/>

...a]]</ref><ref>[http://webdocs.cs.ualberta.ca/~games/aphid/index.html APHID Parallel Game-Tree Search Library]</ref>. ...ments to Parallel Alpha-Beta Algorithms''. Technical report, Department of Computing Science, [[University of Alberta]]

...th interests in [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[Languages|programming languages]], [https://en.wikipedia.org/wiki/Robot ...st.go.jp/article/ipsjjip/21/1/21_17/_article Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity]''. [http://www.informatik.uni-trier.de

...lo Tree Search]] applied to [[Shogi]]. He was holding the world record for computing the largest number of digits of [https://en.wikipedia.org/wiki/Pi π] from ...nada] ('''1999'''). ''Fast High-Precision Arithmetic on Distributed Memory Parallel Machines''. [http://www.informatik.uni-trier.de/~ley/db/conf/ppsc/ppsc1999.

...ocessors]''. Proc. Workshop on State-of-the-Art in Scientific and Parallel Computing, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture N

...ESign is faster to determine if the SEE value is below some threshold than computing its actual value <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_v ...allel search] by [[Michel Van den Bergh]], [[CCC]], December 27, 2011 » [[Parallel Search]]

.... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 3, No. 3 ...[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]] ('''2013'''). ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. [[ICG

...ley C. Kuszmaul]] ('''1994'''). ''Massively Parallel Chess''. Third DIMACS Parallel Implementation Challenge, [https://en.wikipedia.org/wiki/Rutgers_University ...http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9812 MIMD-Style Parallel Programming with Continuation-Passing Threads]''. Proceedings of the 2nd In

...] and [[Los Alamos National Laboratory]], where he researched on massively parallel [[Retrograde Analysis|retrograde analysis]] of certain [[Endgame|chess endg * [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report 88-014, Boston University

...] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]] were also co-authors of the parallel [[Massachusetts Institute of Technology|MIT]] chess programs [[StarTech]] a ...pher F. Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science,

...evolution: Active adaptation to unknown environments with self-developing parallel networks''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Bonn ...Visual Aesthetic Perception''. [[IEEE#TACOM|IEEE Transactions on Affective Computing]], Vol. 6, No. 3, [https://bi.snu.ac.kr/Publications/Journals/International

...spired by the [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing] project [https://en.wikipedia.org/wiki/SETI@home SETI@home], consisting of ...llower depths, to implement [https://en.wikipedia.org/wiki/Load_balancing_(computing) load balancing] accordant to the peer nodes' performances. In case of a [[

...Larry Kaufman]], the most recent and strongest version ''Rybka 4'' and the parallel version ''Deep Rybka 4'' appeared in April 2010, market as standalone chess .... [http://www.journals.elsevier.com/entertainment-computing/ Entertainment Computing], Vol. 5, No. 3

...rsion 0.80 in Apil 2015 introduced a [[Thread|threaded]] [[Parallel Search|parallel search]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56030 Andscac * [http://www.talkchess.com/forum/viewtopic.php?t=58298&start=52 Re: Why computing K that minimizes the sigmoid func. value?] by [[Daniel José Queraltó]], [

...tics]'' in the context of [[Languages|programming languages]] and parallel computing <ref>[[Denis Dancanet]] ('''1998'''). ''[http://reports-archive.adm.cs.cmu.

...ikipedia.org/wiki/Myrinet Myrinet] [https://en.wikipedia.org/wiki/Cluster_(computing) computer cluster] consisting of [[FPGA|FPGAs]] and [[x86]] PCs. ...PCI] buses, which are conneced to a FPGA card each, simultaneously. The [[Parallel Search|distributed search]] algorithm ran on the [[x86]] nodes as [https://

It performs a [[Parallel Search|parallel search]] using [[Thread|threads]], [[Principal Variation Search|PVS]], and ...com/engineering/computational+intelligence+and+complexity/journal/500 Soft Computing], Vol. 15, No. 4

...terests include [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [https://en.wikipedia.org/wiki/Multi-objective_optimization multi-objecti .../pers/hd/p/Pipan:Ljubo Ljubo Pipan] ('''1997'''). ''Efficient execution of parallel programs using partial strict triggering of program graph nodes''. [http://

...ena,_California Pasadena, California] during the 80s, Felten researched on parallel algorithms for [[nCUBE]] concurrent computers. ...[Rod Morison]], and [[Rob Fatland]], Ed Felten is co-author of the massive parallel chess program [[Waycool]], which played three [[ACM North American Computer

...[Rod Morison]] and [[Rob Fatland]], Steve Otto is co-author of the massive parallel chess program [[Waycool]], which played three [[ACM North American Computer ...hess-Program-Felten-Otto/8883761d14be691f6b50d91346cb15af65762710 A Highly Parallel Chess Program]''. Conference on Fifth Generation Computer Systems

...atier University, Toulouse III] on implementing [[Prolog]] extensions of a parallel [https://en.wikipedia.org/wiki/Inference_engine inference engine] under sup

...r Science, where he wrote his Ph.D. Thesis about ''Efficient Multithreaded Computing'' within the [[Cilk]] project <ref>[http://supertech.csail.mit.edu/cilk/ Th ...the Fifth [[ACM#SIG|ACM SIGPLAN]] Symposium on Principles and Practice of Parallel Programming (PPoPP), [http://supertech.csail.mit.edu/papers/PPoPP95.pdf pdf

...'''1994'''). ''Massively Parallel Chess''. Proceedings of the Third DIMACS Parallel Implementation Challenge, [http://supertech.csail.mit.edu/papers/dimacs94.p ...that we first used as a testbed to develop our ideas for [[Parallel Search|parallel game tree search]].

...n.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel computing] and contributed to [[Cilk]] and its first chess program [[Star Socrates|*S ...that we first used as a testbed to develop our ideas for [[Parallel Search|parallel game tree search]].

...ch spans around [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[SIMD and SWAR Techniques|SIMD]] parallelism, on [https://en.wikipedia.o ...ilk Arts, Inc.'', a start-up developing [[Cilk]] technology for multi-core computing applications, which was acquired by [[Intel]] in August 2009 <ref>[http://w

...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science

...eneration]] routines in [[Assembly|assembly language]], and cleaned up the parallel work-stealing code. ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science

...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...ost singlehandedly built the interface between the [[HiTech]] code and the parallel computer ...

...[Mark Bromley]], [[Roger Frye]], and Kurt Thearling to work on the massive parallel chess program. ...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science

...[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science ...ni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller] ('''1969'''). ''Parallel Program Schemata''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_

...Zhang and Richard Karp presented a general method for deriving randomized parallel [https://en.wikipedia.org/wiki/Branch_and_bound branch-and-bound algorithms ...''1988'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 A randomized parallel branch-and-bound procedure]''. [http://www.informatik.uni-trier.de/%7Eley/d

...of Strongly Ordered Game Trees''. Technical Report TR 81-9, Department of Computing Science , [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/

...ipedia.org/wiki/Image_processing image processing]. GPUs may have more raw computing power than general purpose [https://en.wikipedia.org/wiki/Central_processin * Offload the search in [[Zeta|Zeta]]: run a parallel game tree search with move generation and position evaluation on GPU

...in World Chess Championships] (pdf), Interface, Vol. 2, December 2003, The Computing Sciences Department of [https://en.wikipedia.org/wiki/Elon_University Elon ...allel algorithms] by [[Charles Roberson]], [[CCC]], February 26, 2004 » [[Parallel Search]]

...iki/Fraunhofer_Society Fraunhofer Institute] for Algorithms and Scientific Computing [https://en.wikipedia.org/wiki/SCAI SCAI], working on the broad range of [h ...=38411 On parallelization] by [[Onno Garms]], [[CCC]], March 13, 2011 » [[Parallel Search]]

...1993]], Zzzzzz 3.0 was able to play on five machines in [[Parallel Search|parallel]] <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/5f ...a|alpha-beta]] routine was built around a public domain massively parallel computing environment, [https://en.wikipedia.org/wiki/Parallel_Virtual_Machine PVM].

a Canadian computer scientist and associate professor at Department of Computing Science, [[University of Alberta]]. ...[https://en.wikipedia.org/wiki/High-performance_computing high-performance computing], [https://en.wikipedia.org/wiki/Metacomputing Metacomputing], and [https:/

...mputing]], and [https://en.wikipedia.org/wiki/Massively_parallel massively parallel] [[Algorithms|algorithms]]. After holding positions as Chief Software Archi ...]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-a

...lgorithm''. [https://www.journals.elsevier.com/parallel-computing Parallel Computing], Vol. 10, No. 3</ref>. ...lgorithm''. [https://www.journals.elsevier.com/parallel-computing Parallel Computing], Vol. 10, No. 3

...versity_of_Bologna University of Bologna]. His research interests covers [[Parallel Search|distributed search]], * [[Paolo Ciancarini]] ('''1994'''). ''An Experimental Comparison of Parallel Search Algorithms.'' Technical Report 14-94, [https://en.wikipedia.org/wiki

* [[Parallel Prefix Algorithms]] * [https://www.stmintz.com/ccc/index.php?id=398361 Re: Bitboards, pre-computing moves, and blocked squares?] by [[Steffan Westcott]], [[CCC]], November 30,

...imization], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] while teaching and researching at [https://en.wikipedia.org/wiki/Indian_In ...an]] ('''1995'''). ''[https://link.springer.com/article/10.1007/BF01300863 Parallel structural optimization applied to bone remodeling on distributed memory ma

.... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 4 <ref>[https://en.wikipedia.org/wiki/AVL_tree AVL tree - Wi * [[Liwu Li]], [[Tony Marsland]] ('''1987'''). ''A parallel algorithm for finding a maximum flow in 0-1 networks''. [https://dblp.org/d

...07'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/d ...Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Appl

'''OpenCL''', (Open Computing Language)<br/> an open standard for cross-platform, task-based as well as data-based parallel programming of CPUs, [[GPU|GPUs]], [[FPGA|FPGAs]], [https://en.wikipedia.or

...i/Memetic_algorithm memetic algorithms], massive parallel high performance computing using [[GPU|GPU's]] and the [[x86-64|Xeon Phi]] architecture. ...>, he works on [[Monte-Carlo Tree Search]], [[UCT]], and [[Parallel Search|parallel MCTS]].

...https://en.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel] [[Hardware|hardware architectures]], [https://en.wikipedia.org/wiki/Roboti

...00 Note on an extremal problem arising for unreliable networks in parallel computing]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete

...ate 90s, he was member of the team in developing the [[CilkChess]] massive parallel computer chess program <ref>[https://www.game-ai-forum.org/icga-tournaments ...edings of the USENIX 1997 Annual Technical Conference on UNIX and Advanced Computing Systems, Anaheim, California, [http://supertech.csail.mit.edu/papers/USENIX

...'''). ''[http://www.cis.uab.edu/hyatt/search.html The DTS high-performance parallel tree search algorithm]''</ref>. ...[Rémi Coulom]] ('''2007'''). ''[http://remi.coulom.free.fr/Amsterdam2007/ Computing Elo Ratings of Move Patterns in the Game of Go]''. [[ICGA Journal#30_4|ICGA

...cnl.salk.edu/PDFs/The%20Spacing%20Effect%20on%20NETtalk%2C%20A%20Massively-Parallel%20Network%201986-3906.pdf pdf]</ref>. ...cnl.salk.edu/PDFs/The%20Spacing%20Effect%20on%20NETtalk%2C%20A%20Massively-Parallel%20Network%201986-3906.pdf pdf]

Since then he is faculty member in the School of Computing Science at [https://en.wikipedia.org/wiki/Simon_Fraser_University Simon Fra ...and published along with [[Tony Marsland]] on their experience with their parallel chess program [[Parabelle]] based on [[Ken Thompson|Ken Thompson's]] progra

...'Experiments in Selective Search Extensions''. M.Sc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public The basis of both the sequential and parallel chess programs was an [[Iterative Deepening|iterative deepening]] (ID) fram

...Colorado Boulder, Colorado], currently working on massive parallel [[GPU]] computing. Before moving to Boulder, Colorado, Jacques Middlecoff was affiliated with ...ed memory computers''. [https://dblp.org/db/journals/pc/pc29.html Parallel Computing, Vol. 29 No. 8]

...]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=920418 A Matrix for Computing the Jones Polynomial of a Knot]''. Ph.D. thesis, advisor [[Mathematician#Al ...le]] [[Macintosh]] such as [[Crafty]] and [[Stockfish]], [[Parallel Search|parallel search]] topics, and writing his own engine [[Kirby]] <ref>[http://www.talk

a prototypical implementation of a twofold [[Parallel Search|distributed game-tree search]] approach. ...uster cluster], where optimistic [[Pondering|pondering]] performs a second parallel approach on top of several clusters which can be used to achieve a further

...e [[PT 49]] operated by [[Timo Haupt]] - losing from later winner, massive parallel [[Jonny]] and runner-up [[Shredder]] on 16 cores, shared third along with [ * [https://en.wikipedia.org/wiki/Grid_computing Grid computing from Wikipedia]

...ive parallel programming <ref>[http://charm.cs.uiuc.edu/people/aaronbecker Parallel Programming Laboratory - Aaron Becker]</ref>. <ref>[http://charm.cs.uiuc.edu/people/aaronbecker Parallel Programming Laboratory - Aaron Becker]</ref> <ref>[https://dblp.uni-trier.d

.... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 5, No. 3, [http://magma.maths.usyd.edu.au/~watkins/papers/DHW.pdf p ...to 8 cpus for SF and Komodo] by [[Adam Hair]], [[CCC]], May 31, 2015 » [[Parallel Search]], [[Stockfish]], [[Komodo]]

...www.semdesigns.com/Products/Parlanse/index.html Semantic Designs: PARLANSE Parallel Programming Language for Windows Pentium/80x86]</ref>, a parallel [[Languages|programming language]] <ref>[https://stackoverflow.com/question

...s|algorithms]], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], [[Genetic Programming#EvolutionaryAlgorithms|evolutionary algorithms]], [

...systems], [https://en.wikipedia.org/wiki/Distributed_computing distributed computing] and [https://en.wikipedia.org/wiki/Wireless_network wireless network], and ...Institute of Technology|MIT]], Eric Brewer was contributor of the massive parallel chess program [[Star Socrates|*Socrates]], as mentioned in the participant

* [[Arthur Norman]] ('''1975'''). ''Computing with Formal Power Series''. [[ACM#TOMS|ACM Transactions on Mathematical Sof ...bra-on-a-parallel-computer CABAL: polynomial and power series algebra on a parallel computer]''. [https://dblp.uni-trier.de/db/conf/cap/pasco1997.html PASCO 19

.../det/7182/BBC-Computer-Literacy-Project/ BBC - Computer Literacy Project - Computing History]</ref> <ref>[http://www.computinghistory.org.uk/pdf/acorn/BBC-Compu ...rg/wiki/RS-423 PS-423] ports, [https://en.wikipedia.org/wiki/Parallel_port parallel ports], [https://en.wikipedia.org/wiki/Analog_signal analogue] input ports

His research interests include massively parallel information retrieval, [https://en.wikipedia.org/wiki/Data_mining data mini ...Machine|CM-5]] <ref>[[Bradley Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, [[Massachusetts Institute of Technology|MIT]], [http://su

.... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 2 ...k.springer.com/chapter/10.1007%2F3-540-52921-7_52 Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow]''. [https://dblp.uni-trier.de/db/c

...//www.computermuseum.org.uk/fixed_pages/meiko_computing_surface.html Meiko Computing Surface CS1] from [http://www.computermuseum.org.uk/ The Jim Austin Compute ...whose development begun by [[Mark Taylor]] and [[David Levy]] in 1985, the parallel implementation was done by [[Greg Wilson]].

...s, intended for [https://en.wikipedia.org/wiki/Parallel_computing parallel computing]. Chess programs running on massive Transputer networks were [[Moby]] and [ [[Zugzwang (Program)|Zugzwang's]] distributed [[Parallel Search|parallel search]] algorithm works for any underlying Transputer network, a [[De Brui

...eg Wilson developed the [[Parallel Search|parallel search]] of the massive parallel [[Transputer]] program [[Moby]], which was based on [[Cyrus 68K]] by [[Mark ...a [https://en.wikipedia.org/wiki/Meiko_Scientific#Computing_Surface Meiko Computing Surface] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?i

...s and solving problems with "irregular" structures, like [[Parallel Search|parallel game tree search]]. ...('''1994'''). ''[https://publikationen.bibliothek.kit.edu/329894 Massively Parallel Search for Transition-Tables of Polyautomata]''. [https://dblp.uni-trier.de

His research interests include parallel numerical algorithms for solving [https://en.wikipedia.org/wiki/Partial_dif ...onvection-Diffusion]''. [https://en.wikipedia.org/wiki/Computing_(journal) Computing], Vol. 66, No. 2

...llel] and [https://en.wikipedia.org/wiki/Distributed_computing distributed computing], in particular [https://en.wikipedia.org/wiki/Scalability scalability], [h ...pers on that topic <ref>[[Jonathan Schaeffer]] ('''1987'''). ''Speculative Computing''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 118-124</ref>.

...computing] and [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] along with [[Languages|programming language]] and [https://en.wikipedia.or ...avid David Klappholz] ('''1985'''). ''Refined C: A Sequential Language for Parallel Programming''. [https://dblp.uni-trier.de/db/conf/icpp/icpp1985.html ICPP 1

...ptimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models. ...or machine]''. [https://dblp.uni-trier.de/db/journals/pc/pc6.html Parallel Computing, Vol 6.], No. 3

...he researched along with [[Tony Marsland]] and [[Jonathan Schaeffer]] on [[Parallel Search]] and Virtual Tree Machines, ...[[Phoenix|Sun Phoenix]] at [[ACM 1988]] and apparently contributed to the parallel search

a Canadian mathematician and professor of computing science at [[University of Alberta]], Ph.D. in applied mathematics from the ...[[Programming|programming]] environments and [[Parallel Computing|parallel computing]].

...gn pattern] and [https://en.wikipedia.org/wiki/Parallel_computing parallel computing]. ...oberts/08949f0e9e81fe732839a5c5be4b3ab1fdedafb4 Architectural Patterns for Parallel Programming]''. [https://dblp.uni-trier.de/db/conf/europlop/europlop1998.ht

...al intelligence]], new [https://en.wikipedia.org/wiki/Programming_paradigm computing paradigms], and [https://en.wikipedia.org/wiki/Analysis_of_algorithms analy ...c fuzzy logic], [[Genetic Programming#EvolutionaryComputation|evolutionary computing]], and [https://en.wikipedia.org/wiki/Chaos_theory chaotic systems].

...e Architecture) [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] [https://en.wikipedia.org/wiki/Application_programming_interface API] for * [https://docs.nvidia.com/cuda/parallel-thread-execution/index.html Nvidia PTX ISA]

...ondele further improves scientific [https://en.wikipedia.org/wiki/Library_(computing) software libraries] and program packages, * [[Joost VandeVondele]] ('''2009'''). ''CP2K: parallel algorithms''. [https://www.cscs.ch/fileadmin/user_upload/contents_publicati

Beside a [[Parallel Search|parallel tree search]], Bonanza is able to apply parallelization by the so called '' .... [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 3, No. 3

[[GPU|GPU computing]] for large-scale scientific computing, [https://en.wikipedia.org/wiki/Image_processing image processing], ...search-projects/i/66/5966.html A Little Green Machine for High Performance Parallel Multipurpose Supercomputing Using Graphical Processing Units]</ref>,

is able to [[Parallel Search|search in parallel]] on up to 16 processors. [[Selectivity]] is achieved through [[Null Move P * [https://en.wikipedia.org/wiki/Nebula_%28computing_platform%29 Nebula (computing platform) from Wikipedia]

.... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 7, No. 4 ...uni-trier.de/db/journals/ijpp/ijpp15.html#NauPT86 International Journal of Parallel Programming, Vol. 15], No. 2

.... [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 32, No. 1, [http://cseweb.ucsd.edu/~yfreund/papers/bandits.pdf 2001 ...]] ('''2018'''). ''Tell Me Something New: A New Framework for Asynchronous Parallel Learning''. [https://arxiv.org/abs/1805.07483 arXiv:1805.07483]

...anian computer scientist, electrical engineer and head of high-performance computing and visualization at [https://nl.wikipedia.org/wiki/SURFsara SURFsara], [ht .../wiki/University_of_Groningen University of Groningen], working on [[GPU]] computing, [https://en.wikipedia.org/wiki/Computer_vision computer vision], and [http

...n.wikipedia.org/wiki/Massively_parallel_%28computing%29 massively parallel computing] using [[GPU|GPUs]], along with [[Deep Learning|deep learning]]. ...ortegies Zwart]] ('''2020'''). ''The Ecological Impact of High-performance Computing in Astrophysics''. [https://arxiv.org/abs/2009.11295 arXiv:2009.11295]

His research interests include [[Parallel Computing|parallel computing]], ...blem''. [https://dblp.org/db/journals/npsc/npsc7.html#Konigsberg99 Neural, Parallel & Scientific Computations, Vol. 7], No. 4