Changes

Jump to: navigation, search

Parwell

No change in size, 14:35, 23 May 2018
no edit summary
'''Parwell''',<br/>
a chess program by [[Thomas Nitsche]], [[Elmar Henne]] and [[Wolfram Wolff]], which performed a [[Parallel Search|distributed search]] on a 128 processor ([[8080]]) [https://en.wikipedia.org/wiki/Siemens Siemens] [[SMS 201]] <ref>[http://www.siemens.com/innovation/en/publikationen/publications_pof/pof_fall_2002/robots_articles/artificial_intelligence.htm Rudolf Kober] ('''1977'''). ''[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=680830&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel4%2F5585%2F14957%2F00680830 The Multiprocessor System SMS 201 Combining 128 Microprocessors To A Powerful Computer]''. Siemens AG</ref> computer from the [[Technical University of Munich]]. Parwell was based on Nitsche's early serial program [[Orwell]] <ref>[https://www.computerwoche.de/a/muenchner-student-fordert-weltmeister-heraus-orwell-stand-fuer-parwell-pate,1192808 Münchner Student fordert Weltmeister heraus: Orwell stand für Parwell Pate], [[Computerworld#Woche|Computerwoche]], May 18, 1979 (German)</ref>, it was written in [[Fortran]] and [[8080]] [[Assembly]] and searched about 300 [[Nodes per secondSecond|nodes per second]] <ref>[[David Levy]], [[Monroe Newborn]] ('''1982'''). ''[http://link.springer.com/book/10.1007/978-3-642-85538-2 All About Chess and Computers]''. 2nd edition, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], Postscript 1978-80 and Belle, pp. 109</ref>.
=Tournament Play=

Navigation menu