...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
26 KB (3,485 words) - 18:37, 12 March 2022
...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
17 KB (2,418 words) - 11:16, 3 July 2021
* [[ACM]] - Association for Computing Machinery
* [[Parallel Search#PrincipalVariationSplitting|PVS]] - Principal Variation '''Splitting
10 KB (1,192 words) - 22:14, 18 November 2020
* [[Parallel Computing]]
* [[Parallel Prefix Algorithms]]
11 KB (1,411 words) - 02:57, 26 October 2023
* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]]
* [[Parallel Search]]
22 KB (2,849 words) - 10:34, 5 April 2021
...home] kind of [https://en.wikipedia.org/wiki/Volunteer_computing volunteer computing].
* [[Parallel Search]] using [[Thread|Threads]]
65 KB (8,362 words) - 13:19, 1 March 2024
...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
54 KB (7,939 words) - 06:55, 24 September 2023
...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.
23 KB (3,163 words) - 17:06, 21 March 2021
==Parallel==
...org/comp-hist/BRL61.html#TOC A Third Survey of Domestic Electronic Digital Computing Systems]''. Report No. 1115
13 KB (1,631 words) - 09:09, 15 October 2023
...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
19 KB (2,807 words) - 21:04, 27 December 2019
...<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
24 KB (2,852 words) - 18:36, 25 February 2021
...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
25 KB (3,329 words) - 21:14, 28 March 2022
=Parallel Search=
In [[Parallel Search#ThreadsVsProcesses|Parallel search]], multiple [[Thread|threads]] within one process are more common, b
7 KB (974 words) - 20:40, 9 November 2020
...]], 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
14 KB (1,937 words) - 17:07, 16 November 2020
...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
91 KB (12,241 words) - 21:01, 28 March 2022
...] ('''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
17 KB (2,527 words) - 23:40, 18 February 2021
...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
21 KB (2,855 words) - 15:20, 23 December 2020
...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
18 KB (2,693 words) - 16:15, 16 November 2020
...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]]
23 KB (3,095 words) - 10:16, 26 June 2021
...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
30 KB (4,044 words) - 13:16, 18 September 2020
...[[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>.
12 KB (1,783 words) - 17:57, 26 December 2019
=Parallel Search=
* [[Parallel Search]]
34 KB (4,570 words) - 22:36, 17 May 2023
* [[Parallel Search#ParallelAlphaBeta|Parallel Alpha-Beta]]
: [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta in Cilk]]
37 KB (5,099 words) - 16:20, 1 December 2021
...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>.
15 KB (2,159 words) - 11:21, 31 May 2021
...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
137 KB (18,484 words) - 00:18, 19 December 2021
...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
28 KB (3,999 words) - 00:15, 1 February 2022
...''). ''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
13 KB (1,716 words) - 17:09, 16 November 2020
...'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>.
40 KB (5,641 words) - 18:55, 25 December 2020
...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]]
6 KB (832 words) - 15:09, 22 November 2018
...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
62 KB (8,279 words) - 13:30, 17 November 2021
...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
94 KB (12,233 words) - 00:52, 18 January 2022
* [[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
26 KB (3,630 words) - 18:39, 12 March 2022
...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
13 KB (1,828 words) - 22:44, 17 May 2023
* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]]
...n and stacks in BASIC)]''. [[Creative Computing#Best3|The Best of Creative Computing Volume 3]] ยป [[Basic]]
17 KB (2,415 words) - 12:56, 19 November 2021
'''[[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.
86 KB (11,607 words) - 18:34, 11 November 2021
...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 [
24 KB (3,307 words) - 21:17, 7 October 2020
...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
52 KB (7,240 words) - 22:33, 16 May 2023
...''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
25 KB (3,365 words) - 11:19, 6 August 2021
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
75 KB (10,498 words) - 05:16, 28 September 2022
...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
32 KB (4,448 words) - 11:56, 4 April 2022
...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
30 KB (4,128 words) - 05:07, 16 March 2024
'''[[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> .
20 KB (2,160 words) - 09:44, 7 October 2021
'''[[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
12 KB (1,713 words) - 17:23, 30 December 2020
'''[[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
4 KB (604 words) - 20:55, 22 June 2021
...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=
11 KB (1,549 words) - 14:23, 9 December 2020
a parallel chess program, developed by a team from [[Massachusetts Institute of Techno
=Massively Parallel Chess=
10 KB (1,555 words) - 11:46, 15 September 2020
...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
6 KB (843 words) - 17:52, 26 December 2019
* [[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>
173 KB (22,418 words) - 20:37, 6 April 2022
...to be loaded into six identical hardware units computing pawn structure in parallel.
5 KB (726 words) - 20:29, 27 June 2020
...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
54 KB (7,310 words) - 11:16, 4 April 2022
