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

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