25,161
edits
Changes
Created page with "'''Home * Engines * J. Biit''' FILE:Everest kalapatthar.jpg|border|right|thumb|200px|Just Because it is there <ref>Everest from [https://en.wikipedia.org/..."
'''[[Main Page|Home]] * [[Engines]] * J. Biit'''
[[FILE:Everest kalapatthar.jpg|border|right|thumb|200px|Just Because it is there <ref>Everest from [https://en.wikipedia.org/wiki/Kala_Patthar Kala Patthar] in [https://en.wikipedia.org/wiki/Nepal Nepal], [https://en.wikipedia.org/wiki/Mount_Everest Mount Everest from Wikipedia]</ref> ]]
'''J. Biit''',<br/>
[[Hans Berliner|Hans Berliner's]] first chess program, written in the late 60s in [[PL 1|PL/I]] to ran on an [[IBM 360|IBM System/360]] [https://en.wikipedia.org/wiki/Mainframe_computer mainframe computer] <ref>[[George Atkinson]] ('''1998'''). ''[http://books.google.com/books?id=ZuTvVo4zo6oC&printsec=frontcover&dq=Chess+and+machine+intuition#v=onepage&q&f=false Chess and Machine Intuition]''. (Intellect Ltd.) pp 61</ref> . It played the [[ACM 1970|First United States Computer Chess Championship]] 1970 in [https://en.wikipedia.org/wiki/New_York_City New York City], and won versus [[Awit|Wita]], lost from [[Chess (Program)|Chess 3.0]] and drew [[Coko|Coko III]].
Along with [[Daly CP]], J. Biit was one of the first chess programs operated through a [[GUI|Graphical User Interface]]. The UI was written at [[Columbia University]] for the [https://en.wikipedia.org/wiki/IBM_2250 IBM 2250 Display Unit], and later evolved along with J. Biit to become the [[CCCP (US)|Columbia Computer Chess Program]] dubbed CCCP <ref>[http://www.columbia.edu/cu/computinghistory/elliott-frank.html#cccp Recollections of CUCC 1968-70 -The CCCP Chess Program]</ref>.
J. Biit is the acronym of "Just Because it is there", probably in dependance of the famous quote <ref>[http://en.wikiquote.org/wiki/George_Mallory George Mallory - Because it is there - Wikiquote]</ref> by English mountaineer [https://en.wikipedia.org/wiki/George_Mallory George Mallory], having replied to the question "Why do you want to climb [https://en.wikipedia.org/wiki/Mount_Everest Mount Everest]?".
=Description=
J. Biit was a selective search ([[Type B Strategy|Shannon type B]]) program <ref>Description based on [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> that places considerable emphasis on chess knowledge and restricting the number of positions to be examined, as it scored only 30-100 positions during a search using [[Alpha-Beta|alpha-beta]] and [[Incremental Updates|incremental board updating]]. The program was developed in [https://en.wikipedia.org/wiki/PL/I PL/I] on the [[IBM 360|IBM 360/65]] at [[Carnegie Mellon University|CMU]], but was unable to use that system for the [[ACM 1970|1970 ACM tournament]]. Since the 360 line was supposedly compatable, Kenneth M. King <ref>[http://www.columbia.edu/cu/computinghistory/7090.html The IBM 7090]</ref> offered the services of [[Columbia University|Columbia's]] more powerful IBM 360/91. Unfortunately they discovered that it wasn't as compatable as expected and Berliner and assistants spent two rather frantic weeks making program changes. It used about 200 [https://en.wikipedia.org/wiki/Kibibyte Kibibyte] of [[Memory|memory]] and was about 3500 PL/I statements. The program searches a very small tree. Berliner claimed that, on average, only 30 nodes were examined for a move that required 65 seconds of computation. It used a "[[Quiescence Search|free form of search which terminated in quiescent positions]] ... (with) the only bound being the absolute depth limit of 14 ply." It searched two plies for begining and [[Middlegame|middle games]], and 4 plies for [[Endgame|end games]] .
=Quotes=
[[Hans Berliner]] in his Oral History, March 2005 <ref>[http://www.computerhistory.org/chess/related_materials/oral-history/hans_berliner.oral_history.2005.102630824/index.php?iid=orl-43343bb768f00 Oral History of Hans Berliner], Interviewed by: [http://www.computerhistory.org/trustee/gardner-hendrie Gardner Hendrie], Recorded: March 7, 2005, [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/oral-history/hans_berliner.oral_history.2005.102630824/berliner.oral_history_transcript.2005.103630824.pdf pdf], pp. 12-13</ref> :
And I wrote a program which actually played chess. And I did it in the way [[Richard Greenblatt|Greenblatt]] said it ought to be done <ref>[[Richard Greenblatt]], [[Donald Eastlake]] and [https://en.wikipedia.org/wiki/Steve_Crocker Stephen D. Crocker] ('''1967'''). ''The Greenblatt Chess Program''. Proceedings of the AfiPs Fall Joint Computer Conference, Vol. 31, pp. 801-810.</ref> . It wasn’t anywhere’s near as good a [[Mac Hack|Greenblatt’s program]] and I wasn’t really a very good programmer obviously, since that was the first time I had written a program...
So it played. Let’s see, I’ve got to get the timeline right here. Now this was in 1970. Now in 1970 I had already left IBM. I left IBM in 1969, and went to [[Carnegie Mellon University|Carnegie Mellon]] as a doctoral student.
And, of course, their attraction with [[Allen Newell|Newell]] and [[Herbert Simon|Simon]] was they would like to find somebody to push their ideas further forward, and that was me. And so I had this program which, in retrospect, was pretty woesome.
=See also=
* [[Various Classifications#Acronym|Acronym]]
=Publications=
* [[Hans Berliner]] ('''1970'''). ''Experiences Gained in Constructing and Testing a Chess Program''. [[IEEE]] Symposium System Science and Cybernetics, reprinted in [[David Levy]] (ed.) ('''1988'''). ''[http://link.springer.com/book/10.1007/978-1-4613-8716-9 Computer Games I]''.
=External Links=
==Chess Program==
* [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>
==Misc==
* [[Videos#MichaelHedges|Michael Hedges]] - Because It's There <ref>[https://en.wikipedia.org/wiki/Naomi_Uemura Naomi Uemura from Wikipedia]</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: July 1986 at the [https://en.wikipedia.org/wiki/Wolf_Trap_National_Park_for_the_Performing_Arts Wolf Trap National Park for the Performing Arts] in [https://en.wikipedia.org/wiki/Vienna,_Virginia Vienna, Virginia]
: {{#evu:https://www.youtube.com/watch?v=jN3439l4HR0|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[FILE:Everest kalapatthar.jpg|border|right|thumb|200px|Just Because it is there <ref>Everest from [https://en.wikipedia.org/wiki/Kala_Patthar Kala Patthar] in [https://en.wikipedia.org/wiki/Nepal Nepal], [https://en.wikipedia.org/wiki/Mount_Everest Mount Everest from Wikipedia]</ref> ]]
'''J. Biit''',<br/>
[[Hans Berliner|Hans Berliner's]] first chess program, written in the late 60s in [[PL 1|PL/I]] to ran on an [[IBM 360|IBM System/360]] [https://en.wikipedia.org/wiki/Mainframe_computer mainframe computer] <ref>[[George Atkinson]] ('''1998'''). ''[http://books.google.com/books?id=ZuTvVo4zo6oC&printsec=frontcover&dq=Chess+and+machine+intuition#v=onepage&q&f=false Chess and Machine Intuition]''. (Intellect Ltd.) pp 61</ref> . It played the [[ACM 1970|First United States Computer Chess Championship]] 1970 in [https://en.wikipedia.org/wiki/New_York_City New York City], and won versus [[Awit|Wita]], lost from [[Chess (Program)|Chess 3.0]] and drew [[Coko|Coko III]].
Along with [[Daly CP]], J. Biit was one of the first chess programs operated through a [[GUI|Graphical User Interface]]. The UI was written at [[Columbia University]] for the [https://en.wikipedia.org/wiki/IBM_2250 IBM 2250 Display Unit], and later evolved along with J. Biit to become the [[CCCP (US)|Columbia Computer Chess Program]] dubbed CCCP <ref>[http://www.columbia.edu/cu/computinghistory/elliott-frank.html#cccp Recollections of CUCC 1968-70 -The CCCP Chess Program]</ref>.
J. Biit is the acronym of "Just Because it is there", probably in dependance of the famous quote <ref>[http://en.wikiquote.org/wiki/George_Mallory George Mallory - Because it is there - Wikiquote]</ref> by English mountaineer [https://en.wikipedia.org/wiki/George_Mallory George Mallory], having replied to the question "Why do you want to climb [https://en.wikipedia.org/wiki/Mount_Everest Mount Everest]?".
=Description=
J. Biit was a selective search ([[Type B Strategy|Shannon type B]]) program <ref>Description based on [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> that places considerable emphasis on chess knowledge and restricting the number of positions to be examined, as it scored only 30-100 positions during a search using [[Alpha-Beta|alpha-beta]] and [[Incremental Updates|incremental board updating]]. The program was developed in [https://en.wikipedia.org/wiki/PL/I PL/I] on the [[IBM 360|IBM 360/65]] at [[Carnegie Mellon University|CMU]], but was unable to use that system for the [[ACM 1970|1970 ACM tournament]]. Since the 360 line was supposedly compatable, Kenneth M. King <ref>[http://www.columbia.edu/cu/computinghistory/7090.html The IBM 7090]</ref> offered the services of [[Columbia University|Columbia's]] more powerful IBM 360/91. Unfortunately they discovered that it wasn't as compatable as expected and Berliner and assistants spent two rather frantic weeks making program changes. It used about 200 [https://en.wikipedia.org/wiki/Kibibyte Kibibyte] of [[Memory|memory]] and was about 3500 PL/I statements. The program searches a very small tree. Berliner claimed that, on average, only 30 nodes were examined for a move that required 65 seconds of computation. It used a "[[Quiescence Search|free form of search which terminated in quiescent positions]] ... (with) the only bound being the absolute depth limit of 14 ply." It searched two plies for begining and [[Middlegame|middle games]], and 4 plies for [[Endgame|end games]] .
=Quotes=
[[Hans Berliner]] in his Oral History, March 2005 <ref>[http://www.computerhistory.org/chess/related_materials/oral-history/hans_berliner.oral_history.2005.102630824/index.php?iid=orl-43343bb768f00 Oral History of Hans Berliner], Interviewed by: [http://www.computerhistory.org/trustee/gardner-hendrie Gardner Hendrie], Recorded: March 7, 2005, [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/oral-history/hans_berliner.oral_history.2005.102630824/berliner.oral_history_transcript.2005.103630824.pdf pdf], pp. 12-13</ref> :
And I wrote a program which actually played chess. And I did it in the way [[Richard Greenblatt|Greenblatt]] said it ought to be done <ref>[[Richard Greenblatt]], [[Donald Eastlake]] and [https://en.wikipedia.org/wiki/Steve_Crocker Stephen D. Crocker] ('''1967'''). ''The Greenblatt Chess Program''. Proceedings of the AfiPs Fall Joint Computer Conference, Vol. 31, pp. 801-810.</ref> . It wasn’t anywhere’s near as good a [[Mac Hack|Greenblatt’s program]] and I wasn’t really a very good programmer obviously, since that was the first time I had written a program...
So it played. Let’s see, I’ve got to get the timeline right here. Now this was in 1970. Now in 1970 I had already left IBM. I left IBM in 1969, and went to [[Carnegie Mellon University|Carnegie Mellon]] as a doctoral student.
And, of course, their attraction with [[Allen Newell|Newell]] and [[Herbert Simon|Simon]] was they would like to find somebody to push their ideas further forward, and that was me. And so I had this program which, in retrospect, was pretty woesome.
=See also=
* [[Various Classifications#Acronym|Acronym]]
=Publications=
* [[Hans Berliner]] ('''1970'''). ''Experiences Gained in Constructing and Testing a Chess Program''. [[IEEE]] Symposium System Science and Cybernetics, reprinted in [[David Levy]] (ed.) ('''1988'''). ''[http://link.springer.com/book/10.1007/978-1-4613-8716-9 Computer Games I]''.
=External Links=
==Chess Program==
* [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>
==Misc==
* [[Videos#MichaelHedges|Michael Hedges]] - Because It's There <ref>[https://en.wikipedia.org/wiki/Naomi_Uemura Naomi Uemura from Wikipedia]</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: July 1986 at the [https://en.wikipedia.org/wiki/Wolf_Trap_National_Park_for_the_Performing_Arts Wolf Trap National Park for the Performing Arts] in [https://en.wikipedia.org/wiki/Vienna,_Virginia Vienna, Virginia]
: {{#evu:https://www.youtube.com/watch?v=jN3439l4HR0|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
