Search results

Jump to: navigation, search
  • ...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
  • ...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]]
    16 KB (2,296 words) - 09:30, 3 July 2021
  • ...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
    19 KB (2,515 words) - 17:14, 16 November 2020
  • ...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]]
    18 KB (2,422 words) - 15:11, 11 October 2023
  • * [[Parallel Search]] ...el/parallel/docs/dac98.pdf pdf] <ref>[http://www.eecg.toronto.edu/parallel/parallel/numadocs.html Documentation on the NUMAchine Multiprocessor]</ref>
    14 KB (2,013 words) - 00:18, 9 December 2020
  • ...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
    54 KB (7,025 words) - 12:47, 14 March 2022
  • ...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],
    46 KB (6,248 words) - 13:59, 23 May 2021
  • * [[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
    156 KB (21,084 words) - 18:34, 12 March 2022
  • ...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]]
    19 KB (2,702 words) - 21:41, 28 April 2022
  • * [[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
    14 KB (1,791 words) - 00:18, 1 February 2022
  • ...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
    37 KB (4,824 words) - 16:19, 1 December 2021
  • ...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
    11 KB (1,475 words) - 15:33, 29 June 2020
  • .../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
    97 KB (13,316 words) - 20:49, 18 March 2022
  • ...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.
    36 KB (5,000 words) - 01:08, 8 December 2020
  • ...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
    15 KB (1,955 words) - 20:34, 23 May 2019
  • ...''). ''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/
    21 KB (2,723 words) - 12:54, 14 March 2022
  • ...'''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
    7 KB (935 words) - 17:16, 16 November 2020
  • ...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]
    26 KB (2,459 words) - 21:00, 26 January 2021
  • ...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
    8 KB (1,102 words) - 11:25, 28 February 2020
  • ...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,
    19 KB (2,659 words) - 17:19, 16 November 2020
  • ...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.
    28 KB (3,765 words) - 16:01, 16 November 2020
  • ...'). ''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]]
    82 KB (11,101 words) - 11:58, 4 February 2022
  • ==Transactions on Affective Computing== * [https://www.computer.org/web/tac Transactions on Affective Computing]
    15 KB (2,089 words) - 09:25, 29 May 2021
  • ...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
    20 KB (2,709 words) - 10:03, 1 June 2021
  • ...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
    20 KB (2,810 words) - 23:40, 21 March 2020
  • ...]], 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]]
    16 KB (2,213 words) - 17:48, 23 October 2018
  • * [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]
    13 KB (1,897 words) - 17:53, 26 May 2018
  • ...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
    7 KB (896 words) - 19:26, 26 May 2018
  • ...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
    19 KB (2,462 words) - 19:19, 4 April 2022
  • ...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
    9 KB (1,169 words) - 17:20, 16 November 2020
  • 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
    47 KB (6,253 words) - 19:20, 4 April 2022
  • * [[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]
    7 KB (983 words) - 17:21, 16 November 2020
  • 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]]
    10 KB (1,378 words) - 16:25, 1 December 2021
  • ...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
    16 KB (2,041 words) - 17:22, 16 November 2020
  • ...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]]
    8 KB (1,041 words) - 21:57, 3 November 2020
  • ...//pc2.uni-paderborn.de/ Welcome to PC², the Paderborn Center for Parallel Computing]
    2 KB (206 words) - 20:51, 28 June 2021
  • ...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.
    10 KB (1,401 words) - 09:35, 6 July 2021
  • ...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]]
    8 KB (992 words) - 19:28, 8 December 2019
  • ...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
    41 KB (6,029 words) - 08:36, 1 May 2021
  • * [[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
    18 KB (2,577 words) - 19:24, 2 August 2020
  • ...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
    7 KB (848 words) - 17:18, 16 November 2020
  • .../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
    10 KB (1,400 words) - 17:24, 16 November 2020
  • ...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
    10 KB (1,305 words) - 10:08, 11 February 2021
  • ...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
    12 KB (1,650 words) - 16:47, 3 June 2018
  • ...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]]
    12 KB (1,523 words) - 16:22, 1 December 2021
  • ...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
    5 KB (746 words) - 22:10, 9 September 2020
  • ...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
    7 KB (918 words) - 17:27, 16 November 2020
  • ...in the field of [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] concerning [[Memory#Shared|shared memory]] and [[Memory#Cache|cache]] [htt
    5 KB (646 words) - 17:28, 16 November 2020
  • ...in the field of [https://en.wikipedia.org/wiki/Parallel_computing parallel computing] concerning [[Memory#Shared|shared memory]] and [[Memory#Cache|cache]] [htt
    5 KB (735 words) - 17:56, 4 September 2018
  • ...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
    5 KB (782 words) - 15:25, 6 June 2018
  • ...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
    8 KB (997 words) - 15:24, 29 June 2020

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)