25,161
edits
Changes
NSS
,Created page with "'''Home * Engines * NSS Chess Program''' FILE:Johnniac.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/File:Johnniac.jpg| Johnniac <ref>Johnniac..."
'''[[Main Page|Home]] * [[Engines]] * NSS Chess Program'''
[[FILE:Johnniac.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/File:Johnniac.jpg| Johnniac <ref>Johnniac computer, [[The Computer History Museum]], California, by Andrew Lih, [https://en.wikipedia.org/wiki/JOHNNIAC JOHNNIAC from Wikipedia]</ref> ]]
'''NSS Chess Program''', (Newell, Shaw, and Simon, also mentioned as Newell CP <ref>[http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive]</ref>)<br/>
an early chess program developed in the the late 1950s by [[Carnegie Mellon University]] researchers [[Allen Newell]] and [[Herbert Simon]], and [[Cliff Shaw]] at [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]. NSS ran on the [https://en.wikipedia.org/wiki/JOHNNIAC JOHNNIAC] (short for '''Joh'''n v. '''N'''eumann '''N'''umerical '''I'''ntegrator and '''A'''utomatic '''C'''omputer), and was written in a high-level language developed by Shaw, known as [https://en.wikipedia.org/wiki/Information_Processing_Language Information Processing Language] (IPL). It already used branch-and-bounds as an approximation to the [[Alpha-Beta|alpha-beta algorithm]].
=Photos=
[[FILE:carnegie-mellon-university.newell-allen-simon-herbert.19xx.l062302007.cmu.jpg|none|border|text-bottom|640px|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-431e1a07cf7a1]]
In the late 1950s, [[Carnegie Mellon University]] researchers [[Allen Newell]] (r) and [[Herbert Simon]] (l), <br/>
together with [[Cliff Shaw]] (not shown) at the [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], were early pioneers in the field of<br/>
artificial intelligence and chess software. The NSS program ran on the [https://en.wikipedia.org/wiki/JOHNNIAC Johnniac] computer ... <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431e1a07cf7a1 Aritificial Intelligence pioneers Allen Newell (right) and Herbert Simon 1958] Courtesy of [[Carnegie Mellon University]], [[The Computer History Museum]]</ref>
=Description=
given by [[Paul Rushton]] and [[Tony Marsland]] in 1973 <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> :
A goal directed approach to the game was adopted by Newell, Shaw, and Simon. Features of the game were associated with goals, each of which required a [[Move Generation|move generator]], a [[Evaluation|static evaluator]], and an analysis procedure. For ease of modification, each goal consisted of a separate procedure. In order to select which goals were relevant to a position, a preliminary analysis routine was invoked and the corresponding goals chosen were ordered by their suspected importance. This static set of goals controls the move generation process, including selection of variations, evaluation, and final choice.
Move generators for goals were responsible for proposing moves relevant to a particular goal and finding positive reasons for making these. The generators did not suggest continuations. A proposed move had then to be valued by an analysis procedure which was concerned with acceptability of that move. Before a position can be assigned a value it must be dead with respect to all goals. If a position is not dead for a particular goal, moves are suggested by the corresponding move generator and the resultant positions are checked to see if they are quiescent for all goals. If not, the above procedure is repeated, constituting an analysis of variations, until a position is reached which can be evaluated. The final choice depends on an acceptance value and if a move receives a value greater than this threshold it is played, otherwise the best move found by the [[Alpha-Beta|alpha-beta]] backing up procedure will be made. This program did not realize the state of development and use that the more recent programs have; however, hand simulation gave an indication, in the openings at least, that the program would make moves for reasons similar to those of chess players.
=Quotes=
[[Bill Wall]] <ref>[http://www.oocities.org/siliconvalley/lab/7378/comphis.htm Computer Chess History] by [[Bill Wall]]</ref>
In 1958, a chess program (NSS) beat a human player for the first time. The human player was a secretary who was taught how to play chess one hour before her game with the computer. The computer program was played on an IBM 704. The computer displayed a level of chess-playing expertise greater than an adult human could gain from one hour of chess instruction.
=See also=
* [[Various Classifications#Acronym|Acronym]]
* [[Mater]]
=Publications=
* [[Allen Newell]], [[Cliff Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in [http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=6685 Computers and Thought] (eds. [[Edward Feigenbaum]] and [[Mathematician#JulianFeldman|Julian Feldman]]), pp. 39-70. McGraw-Hill, New York, N.Y. [http://aitopics.org/sites/default/files/classic/Feigenbaum_Feldman/C&T-Newll-Shaw-Simon.pdf pdf]
* [[Allen Newell]], [[Cliff Shaw]], [[Herbert Simon]] ('''1959'''). ''Report on a general problem-solving program''. Proceedings of the International Conference on Information Processing, pp. 256-264 <ref>[https://en.wikipedia.org/wiki/General_Problem_Solver General Problem Solver from Wikipedia]</ref>
* [[Walter R. Reitman]] ('''1967'''). ''[http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bsmsp/1200513787 Modeling the formation and use of concepts, percepts, and rules]''. [http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bsmsp/1200513779 Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 4: Biology and Problems of Health], [http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.bsmsp/1200513787 pdf] from [http://projecteuclid.org/DPubS?Service=UI&version=1.0&verb=Display&handle=euclid Project Euclid - mathematics and statistics resources online]
* [[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/%7Etony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]
=External Links=
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
* [http://www.computerhistory.org/chess/search.php?more=&submitted=1&keywords=Johnniac&x=17&y=13&all=all&item_document=item_document&item_moving_image=item_moving_image&item_artifact=item_artifact&item_still_image=item_still_image&item_oral_history=item_oral_history&item_software=item_software Johnniac at computerhistory.org]
=References=
<references />
'''[[Engines|Up one Level]]'''
[[FILE:Johnniac.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/File:Johnniac.jpg| Johnniac <ref>Johnniac computer, [[The Computer History Museum]], California, by Andrew Lih, [https://en.wikipedia.org/wiki/JOHNNIAC JOHNNIAC from Wikipedia]</ref> ]]
'''NSS Chess Program''', (Newell, Shaw, and Simon, also mentioned as Newell CP <ref>[http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive]</ref>)<br/>
an early chess program developed in the the late 1950s by [[Carnegie Mellon University]] researchers [[Allen Newell]] and [[Herbert Simon]], and [[Cliff Shaw]] at [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]. NSS ran on the [https://en.wikipedia.org/wiki/JOHNNIAC JOHNNIAC] (short for '''Joh'''n v. '''N'''eumann '''N'''umerical '''I'''ntegrator and '''A'''utomatic '''C'''omputer), and was written in a high-level language developed by Shaw, known as [https://en.wikipedia.org/wiki/Information_Processing_Language Information Processing Language] (IPL). It already used branch-and-bounds as an approximation to the [[Alpha-Beta|alpha-beta algorithm]].
=Photos=
[[FILE:carnegie-mellon-university.newell-allen-simon-herbert.19xx.l062302007.cmu.jpg|none|border|text-bottom|640px|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-431e1a07cf7a1]]
In the late 1950s, [[Carnegie Mellon University]] researchers [[Allen Newell]] (r) and [[Herbert Simon]] (l), <br/>
together with [[Cliff Shaw]] (not shown) at the [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], were early pioneers in the field of<br/>
artificial intelligence and chess software. The NSS program ran on the [https://en.wikipedia.org/wiki/JOHNNIAC Johnniac] computer ... <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431e1a07cf7a1 Aritificial Intelligence pioneers Allen Newell (right) and Herbert Simon 1958] Courtesy of [[Carnegie Mellon University]], [[The Computer History Museum]]</ref>
=Description=
given by [[Paul Rushton]] and [[Tony Marsland]] in 1973 <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> :
A goal directed approach to the game was adopted by Newell, Shaw, and Simon. Features of the game were associated with goals, each of which required a [[Move Generation|move generator]], a [[Evaluation|static evaluator]], and an analysis procedure. For ease of modification, each goal consisted of a separate procedure. In order to select which goals were relevant to a position, a preliminary analysis routine was invoked and the corresponding goals chosen were ordered by their suspected importance. This static set of goals controls the move generation process, including selection of variations, evaluation, and final choice.
Move generators for goals were responsible for proposing moves relevant to a particular goal and finding positive reasons for making these. The generators did not suggest continuations. A proposed move had then to be valued by an analysis procedure which was concerned with acceptability of that move. Before a position can be assigned a value it must be dead with respect to all goals. If a position is not dead for a particular goal, moves are suggested by the corresponding move generator and the resultant positions are checked to see if they are quiescent for all goals. If not, the above procedure is repeated, constituting an analysis of variations, until a position is reached which can be evaluated. The final choice depends on an acceptance value and if a move receives a value greater than this threshold it is played, otherwise the best move found by the [[Alpha-Beta|alpha-beta]] backing up procedure will be made. This program did not realize the state of development and use that the more recent programs have; however, hand simulation gave an indication, in the openings at least, that the program would make moves for reasons similar to those of chess players.
=Quotes=
[[Bill Wall]] <ref>[http://www.oocities.org/siliconvalley/lab/7378/comphis.htm Computer Chess History] by [[Bill Wall]]</ref>
In 1958, a chess program (NSS) beat a human player for the first time. The human player was a secretary who was taught how to play chess one hour before her game with the computer. The computer program was played on an IBM 704. The computer displayed a level of chess-playing expertise greater than an adult human could gain from one hour of chess instruction.
=See also=
* [[Various Classifications#Acronym|Acronym]]
* [[Mater]]
=Publications=
* [[Allen Newell]], [[Cliff Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in [http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=6685 Computers and Thought] (eds. [[Edward Feigenbaum]] and [[Mathematician#JulianFeldman|Julian Feldman]]), pp. 39-70. McGraw-Hill, New York, N.Y. [http://aitopics.org/sites/default/files/classic/Feigenbaum_Feldman/C&T-Newll-Shaw-Simon.pdf pdf]
* [[Allen Newell]], [[Cliff Shaw]], [[Herbert Simon]] ('''1959'''). ''Report on a general problem-solving program''. Proceedings of the International Conference on Information Processing, pp. 256-264 <ref>[https://en.wikipedia.org/wiki/General_Problem_Solver General Problem Solver from Wikipedia]</ref>
* [[Walter R. Reitman]] ('''1967'''). ''[http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bsmsp/1200513787 Modeling the formation and use of concepts, percepts, and rules]''. [http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bsmsp/1200513779 Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 4: Biology and Problems of Health], [http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.bsmsp/1200513787 pdf] from [http://projecteuclid.org/DPubS?Service=UI&version=1.0&verb=Display&handle=euclid Project Euclid - mathematics and statistics resources online]
* [[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/%7Etony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]
=External Links=
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
* [http://www.computerhistory.org/chess/search.php?more=&submitted=1&keywords=Johnniac&x=17&y=13&all=all&item_document=item_document&item_moving_image=item_moving_image&item_artifact=item_artifact&item_still_image=item_still_image&item_oral_history=item_oral_history&item_software=item_software Johnniac at computerhistory.org]
=References=
<references />
'''[[Engines|Up one Level]]'''
