25,161
edits
Changes
Created page with "'''Home * Engines * Blitz''' FILE:Lightnings sequence 2 animation-wcag.gif|border|right|thumb| Blitz <ref>Intercloud lightnings over [https://en.wikipedia..."
'''[[Main Page|Home]] * [[Engines]] * Blitz'''
[[FILE:Lightnings sequence 2 animation-wcag.gif|border|right|thumb| Blitz <ref>Intercloud lightnings over [https://en.wikipedia.org/wiki/Toulouse Toulouse] (France), August 12, 2006, original data by Sebastien D'Arco, Animation by [https://commons.wikimedia.org/wiki/User:Koba-chan Koba-chan], [https://creativecommons.org/licenses/by-sa/2.5/ CC BY-SA 2.5], [https://de.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [http://de.wikipedia.org/wiki/Blitz Blitz wikipedia.de] (German)</ref> ]]
'''Blitz''',<br/>
the first chess program by primary author [[Robert Hyatt]] and chess advisor [[Albert Gower]] from [[University of Southern Mississippi]]. Blitz was a [[Type B Strategy|Shannon Type B]] program written in [[Fortran]]. It played the [[ACM 1976]], [[ACM 1977]], the [[WCCC 1977]], [[ACM 1978]], the [[ACM 1979]] (ran on [[UNIVAC 1100|UNIVAC 1100/80]]), until at the [[ACM 1980]] successor [[Cray Blitz]] appeared.
=Description=
[[Robert Hyatt|Bob Hyatt's]] reply to [[Christophe Théron]] on Blitz <ref>[http://www.stmintz.com/ccc/index.php?id=14031 Re: Square-of-the-pawn] by [[Robert Hyatt]], [[CCC]], January 13, 1998</ref>:
Bob, what kind of selection did you use in this early "Blitz"?
It was a [[Type B Strategy|forward pruning search]]. Basically searched roughly 6 moves at each ply, to a depth of 5 ply. There was no [[Quiescence Search|capture search]] after it, just a complex (for the time) static evaluation that also used a [[Static Exchange Evaluation|Static Exchange Evaluator]] to make sure the last move was safe.
The most interesting parts were the following:
1. It had about 30,000 lines of code dedicated to analyzing the set of legal moves at any ply and pick out the moves that appeared to be tactically or positionally promising.
2. It had a "causality analysis" procedure that was invoked at any point in the search where the score dropped. Since I found it hard to recognize I was in trouble and to select moves that would defend against threats that were hard to see from the "other side" I let my tactical analysis find good moves, and if it was successful, at the next ply, after searching a couple of moves and finding that the score was too low, this "causality" facility could look at the PV and figure out what was going wrong and then select moves that had a chance of "fixing" things.
Worked very well, was tactically very dangerous... but made the typical positional mistakes that forward pruning programs do. Entire program was over 80,000 lines of code, however. *very* big, when considering that Crafty is under 40,000 lines with a huge number of comments...
What do you mean by "not even a real [[Quiescence Search|quiescence search]]"?
I searched 5 plies and *quit*. I did use a static exchange evaluator to determine if the tip moves were safe. This was searching under 100 nodes per second on a machine that was rated at .7 MIPS. This program finished in a 3-way tie for 2nd at the [[ACM 1976|1976 ACM]] computer chess tournament, but the following year I was "exhaustive"... :)
=See also=
* [[Cray Blitz]]
* [[Various Classifications#Meteorology|Meteorology]]
* [[Petir]]
=Publications=
* Editor ('''1979'''). ''Will Blitz be next year's champ?'' [[Personal Computing]], Vol. 3, No. 7, pp. 80, July 1979 » [[ACM 1978]], [[Belle#Blitz|Blitz 6.5 - Belle]], Round 4
* [[Robert Hyatt]] ('''1980'''). ''A Southern Blitz''. [[Personal Computing#4_6|Personal Computing, Vol. 4, No. 6]], pp. 93
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=435 Blitz' ICGA Tournaments]
==Misc==
* [https://en.wikipedia.org/wiki/Blitz Blitz from Wikipedia]
* [[Videos#TheSweet|The Sweet]] - [https://en.wikipedia.org/wiki/The_Ballroom_Blitz The Ballroom Blitz], [https://en.wikipedia.org/wiki/Top_of_the_Pops Top Of The Pops] in 1973, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=z_jdiU47bFA|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[FILE:Lightnings sequence 2 animation-wcag.gif|border|right|thumb| Blitz <ref>Intercloud lightnings over [https://en.wikipedia.org/wiki/Toulouse Toulouse] (France), August 12, 2006, original data by Sebastien D'Arco, Animation by [https://commons.wikimedia.org/wiki/User:Koba-chan Koba-chan], [https://creativecommons.org/licenses/by-sa/2.5/ CC BY-SA 2.5], [https://de.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [http://de.wikipedia.org/wiki/Blitz Blitz wikipedia.de] (German)</ref> ]]
'''Blitz''',<br/>
the first chess program by primary author [[Robert Hyatt]] and chess advisor [[Albert Gower]] from [[University of Southern Mississippi]]. Blitz was a [[Type B Strategy|Shannon Type B]] program written in [[Fortran]]. It played the [[ACM 1976]], [[ACM 1977]], the [[WCCC 1977]], [[ACM 1978]], the [[ACM 1979]] (ran on [[UNIVAC 1100|UNIVAC 1100/80]]), until at the [[ACM 1980]] successor [[Cray Blitz]] appeared.
=Description=
[[Robert Hyatt|Bob Hyatt's]] reply to [[Christophe Théron]] on Blitz <ref>[http://www.stmintz.com/ccc/index.php?id=14031 Re: Square-of-the-pawn] by [[Robert Hyatt]], [[CCC]], January 13, 1998</ref>:
Bob, what kind of selection did you use in this early "Blitz"?
It was a [[Type B Strategy|forward pruning search]]. Basically searched roughly 6 moves at each ply, to a depth of 5 ply. There was no [[Quiescence Search|capture search]] after it, just a complex (for the time) static evaluation that also used a [[Static Exchange Evaluation|Static Exchange Evaluator]] to make sure the last move was safe.
The most interesting parts were the following:
1. It had about 30,000 lines of code dedicated to analyzing the set of legal moves at any ply and pick out the moves that appeared to be tactically or positionally promising.
2. It had a "causality analysis" procedure that was invoked at any point in the search where the score dropped. Since I found it hard to recognize I was in trouble and to select moves that would defend against threats that were hard to see from the "other side" I let my tactical analysis find good moves, and if it was successful, at the next ply, after searching a couple of moves and finding that the score was too low, this "causality" facility could look at the PV and figure out what was going wrong and then select moves that had a chance of "fixing" things.
Worked very well, was tactically very dangerous... but made the typical positional mistakes that forward pruning programs do. Entire program was over 80,000 lines of code, however. *very* big, when considering that Crafty is under 40,000 lines with a huge number of comments...
What do you mean by "not even a real [[Quiescence Search|quiescence search]]"?
I searched 5 plies and *quit*. I did use a static exchange evaluator to determine if the tip moves were safe. This was searching under 100 nodes per second on a machine that was rated at .7 MIPS. This program finished in a 3-way tie for 2nd at the [[ACM 1976|1976 ACM]] computer chess tournament, but the following year I was "exhaustive"... :)
=See also=
* [[Cray Blitz]]
* [[Various Classifications#Meteorology|Meteorology]]
* [[Petir]]
=Publications=
* Editor ('''1979'''). ''Will Blitz be next year's champ?'' [[Personal Computing]], Vol. 3, No. 7, pp. 80, July 1979 » [[ACM 1978]], [[Belle#Blitz|Blitz 6.5 - Belle]], Round 4
* [[Robert Hyatt]] ('''1980'''). ''A Southern Blitz''. [[Personal Computing#4_6|Personal Computing, Vol. 4, No. 6]], pp. 93
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=435 Blitz' ICGA Tournaments]
==Misc==
* [https://en.wikipedia.org/wiki/Blitz Blitz from Wikipedia]
* [[Videos#TheSweet|The Sweet]] - [https://en.wikipedia.org/wiki/The_Ballroom_Blitz The Ballroom Blitz], [https://en.wikipedia.org/wiki/Top_of_the_Pops Top Of The Pops] in 1973, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=z_jdiU47bFA|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
