25,161
edits
Changes
Created page with "'''Home * Engines * Fidelity''' FILE:Fidelity-chess-machine.wccc.edmonton.1989.102645423.newborn.jpg|border|right|thumb|link=http://www.computerhistory.or..."
'''[[Main Page|Home]] * [[Engines]] * Fidelity'''
[[FILE:Fidelity-chess-machine.wccc.edmonton.1989.102645423.newborn.jpg|border|right|thumb|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc194e20|Fidelity X at [[WCCC 1989]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc194e20 Fidelity X chess computer at the 6th World Chess Championship in Edmonton, Alberta], [[The Computer History Museum]], Photo courtesy: [[Monroe Newborn|Monty Newborn]]</ref> ]]
'''Fidelity''',<br/>
was a family of [[Dedicated Chess Computers|dedicated Chess Computers]], manufactured by [[Sidney Samole|Sidney Samole's]] company [[Fidelity Electronics]] <ref>[http://www.ismenio.com/fidelity.html Fidelity Electronics] from [http://www.ismenio.com/chess_computers.html chesscomputers.org]</ref>. The early programs were written by [[Ron Nelson]], since 1980/1981 most programs were based on [[Dan Spracklen|Dan]] and [[Kathe Spracklen|Kathe Spracklen's]] [[Sargon]] programs. Fidelity chess computers with Spracklen programs, the commercial available [[Chess Challenger]], [[Elite]], [[Sensory 9|Sensory]], [[Elegance]], [[Private Line]] and the experimental versions coined ''Fidelity X'' as covered on this page, participated in many tournaments with great success and won many world as well as national titles.
=Fidelity X=
==1981-1984==
Fidelity X, which won the [[WMCCC 1981]], was later market as [[Elite|Fidelity Elite Champion]] <ref>[http://www.schach-computer.info/wiki/index.php/Fidelity_CC_Elite_Champion Fidelity Elite Champion Sensory Chess Challenger] from [http://www.schach-computer.info/wiki/index.php/Hauptseite_En Schachcomputer.info Wiki] (German)</ref> <ref>[http://www.chesscomputeruk.com/html/fidelity_elite_champion.html Fidelity Elite Champion] from [http://www.chesscomputeruk.com/index.html Chess Computer UK] by [[Mike Watters]]</ref> . It was based on a [[6502]] [[Sargon]] program by [[Dan Spracklen|Dan]] and [[Kathe Spracklen|Kathe Spracklen's]]. Same or slightly improved hardware played the [[ACM 1982]], the [[WCCC 1983]] and [[ACM 1984]].
==1986==
In 1986, at the [[ACM 1986|17th ACM North American Computer Chess Championship]] in [https://en.wikipedia.org/wiki/Dallas Dallas], Fidelity showed up with two experimental machines. Fidelity Experimental with [[Danny Kopec]] as [[Opening Book Authors|Book author]] had one [[68020]] CPU, where three models also played the [[WMCCC 1986]] some streets farther with compatible time schedule. [[Chess Challenger|Chess Challenger X]] was a parallel system with a [[Z80]] controller, and 16 or more [[68000]] CPUs, co-authored by [[Ron Nelson]], with a Kopec book as well.
==Description 1989==
Fidelity X, alias ''Fidelity/Motorola Challenger'', which played the [[WCCC 1989]] was a 32 bit program, targeting [[Motorola|Motorola's]] [[68030]] processor <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=312 Fidelity]</ref>. Description from the WCCC booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> :
The Fidelity/Motorola Challenger relies for its strength on a combination of state-of-the-art microcomputer hardware and a chess algorithm that has undergone continuous full-time development for over ten years.
The central feature of the hardware is a [[Motorola]] [[68030]] processor, hand-selected by Motorola engineers to run at the fastest possible clock speed. The exact speed will not be known until just prior to tournament time. The system is completed by 32K of program [[Memory#ROM|ROM]], 64K of [[Opening Book|opening book]] ROM, 16K of program [[Memory#RAM|RAM]], one megabyte of dynamic RAM for [[Transposition Table|transposition tables]], and a special 16K of non-volatile RAM that supports the [[Learning|learning]] feature.
The learning feature is just one facet of a multi-faceted chess algorithm. The program is basically [[Brute-Force|brute force]] in origin with evolution to incorporate extensive positional analysis and [[Extensions|selective extensions]] during the [[Quiescence Search|quiescence search]]. The positional analysis incorporates extensive heuristics for [[King Safety|king safety]] and [[Pawn Structure|pawn structure]]. Numerous end-game specific routines are incorporated, icluding [[KBNK Endgame|mate with bishop and knight]], complete evaluation of [[KPK|king and pawn vs. king]], probably outcome of a [[Pawn Race|pawn race]], [[Rule of the Square|square of the pawn]], [[Wrong color Bishop and rook pawn|bishop and rook pawn of the opposite color]], the [[Philidor Position|Philidor]] and [[Lucena Position|Lucena positions]] and others. Dynamic recognition of minimum mating material, [[Fifty-move Rule|fifty move rule]], and [[Repetitions#RepetitionOfPositions|repetition of position]] assist in forestalling heartbreaking draws in otherwise won positions. The search algorithm uses a [[Depth-First|depth first]], [[Alpha-Beta|alpha-beta]] search with the [[Null Window|zero width window]] technique ([[Principal Variation Search|PVS]]). The search proceeds [[Iterative Deepening|iteratively]] with a quiescence search incorporating [[Captures|captures]] and certain threats appended beyond the [[Depth|nominal depth]]. The program will not perform an [[Evaluation|evaluation]] on a position where either king is [[Check|in check]]. The check must first be resolved by showing the existence of an escape move or [[Checkmate|mate]]. Iterations are finally halted under the direction of a [[Time Management|time control algorithm]] which is dynamically incorporated for up to 40 moves in the root position. Two [[Killer Move|killer moves]] are stored at every [[Ply|ply]]. The program performs a preliminary sort on the ply above the quiescence search. The search is supported by extensive [[Transposition Table|transposition tables]] incorporating random numbers selected using [[BCH Hashing|BCH theory]].
=See also=
* [[Boris Baczynskyj#CrayBlitzFidelity|Book Issues in Cray Blitz - Fidelity X @ ACM 1984]]
* [[Fidelity Electronics]]
* [[Excalibur Electronics]]
* [[Hegener & Glaser]]
* [[Sidney Samole]]
* [[Sargon]]
* [[Dan Spracklen]]
* [[Kathe Spracklen]]
=Fidelity Computers=
* [[Chess Challenger]]
* [[Elegance]]
* [[Elite]]
* [[Excel]]
* [[Excellence]]
* [[Fidelity]]
* [[Fidelity Phantom]]
* [[Par Excellence]]
* [[Private Line]]
=External Links=
==Chess Computers==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=312 Fidelity's ICGA Tournaments]
* [http://www.flickr.com/photos/10261668@N05/sets/72157600922170604/ Fidelity | Photo collection] by [[Steve Blincoe|Chewbanta]]
==Misc==
* [https://en.wikipedia.org/wiki/Fidelity Fidelity from Wikipedia]
* [https://en.wikipedia.org/wiki/Fidelity_(disambiguation) Fidelity (disambiguation) from Wikipedia]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Dedicated]]
[[FILE:Fidelity-chess-machine.wccc.edmonton.1989.102645423.newborn.jpg|border|right|thumb|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc194e20|Fidelity X at [[WCCC 1989]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc194e20 Fidelity X chess computer at the 6th World Chess Championship in Edmonton, Alberta], [[The Computer History Museum]], Photo courtesy: [[Monroe Newborn|Monty Newborn]]</ref> ]]
'''Fidelity''',<br/>
was a family of [[Dedicated Chess Computers|dedicated Chess Computers]], manufactured by [[Sidney Samole|Sidney Samole's]] company [[Fidelity Electronics]] <ref>[http://www.ismenio.com/fidelity.html Fidelity Electronics] from [http://www.ismenio.com/chess_computers.html chesscomputers.org]</ref>. The early programs were written by [[Ron Nelson]], since 1980/1981 most programs were based on [[Dan Spracklen|Dan]] and [[Kathe Spracklen|Kathe Spracklen's]] [[Sargon]] programs. Fidelity chess computers with Spracklen programs, the commercial available [[Chess Challenger]], [[Elite]], [[Sensory 9|Sensory]], [[Elegance]], [[Private Line]] and the experimental versions coined ''Fidelity X'' as covered on this page, participated in many tournaments with great success and won many world as well as national titles.
=Fidelity X=
==1981-1984==
Fidelity X, which won the [[WMCCC 1981]], was later market as [[Elite|Fidelity Elite Champion]] <ref>[http://www.schach-computer.info/wiki/index.php/Fidelity_CC_Elite_Champion Fidelity Elite Champion Sensory Chess Challenger] from [http://www.schach-computer.info/wiki/index.php/Hauptseite_En Schachcomputer.info Wiki] (German)</ref> <ref>[http://www.chesscomputeruk.com/html/fidelity_elite_champion.html Fidelity Elite Champion] from [http://www.chesscomputeruk.com/index.html Chess Computer UK] by [[Mike Watters]]</ref> . It was based on a [[6502]] [[Sargon]] program by [[Dan Spracklen|Dan]] and [[Kathe Spracklen|Kathe Spracklen's]]. Same or slightly improved hardware played the [[ACM 1982]], the [[WCCC 1983]] and [[ACM 1984]].
==1986==
In 1986, at the [[ACM 1986|17th ACM North American Computer Chess Championship]] in [https://en.wikipedia.org/wiki/Dallas Dallas], Fidelity showed up with two experimental machines. Fidelity Experimental with [[Danny Kopec]] as [[Opening Book Authors|Book author]] had one [[68020]] CPU, where three models also played the [[WMCCC 1986]] some streets farther with compatible time schedule. [[Chess Challenger|Chess Challenger X]] was a parallel system with a [[Z80]] controller, and 16 or more [[68000]] CPUs, co-authored by [[Ron Nelson]], with a Kopec book as well.
==Description 1989==
Fidelity X, alias ''Fidelity/Motorola Challenger'', which played the [[WCCC 1989]] was a 32 bit program, targeting [[Motorola|Motorola's]] [[68030]] processor <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=312 Fidelity]</ref>. Description from the WCCC booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> :
The Fidelity/Motorola Challenger relies for its strength on a combination of state-of-the-art microcomputer hardware and a chess algorithm that has undergone continuous full-time development for over ten years.
The central feature of the hardware is a [[Motorola]] [[68030]] processor, hand-selected by Motorola engineers to run at the fastest possible clock speed. The exact speed will not be known until just prior to tournament time. The system is completed by 32K of program [[Memory#ROM|ROM]], 64K of [[Opening Book|opening book]] ROM, 16K of program [[Memory#RAM|RAM]], one megabyte of dynamic RAM for [[Transposition Table|transposition tables]], and a special 16K of non-volatile RAM that supports the [[Learning|learning]] feature.
The learning feature is just one facet of a multi-faceted chess algorithm. The program is basically [[Brute-Force|brute force]] in origin with evolution to incorporate extensive positional analysis and [[Extensions|selective extensions]] during the [[Quiescence Search|quiescence search]]. The positional analysis incorporates extensive heuristics for [[King Safety|king safety]] and [[Pawn Structure|pawn structure]]. Numerous end-game specific routines are incorporated, icluding [[KBNK Endgame|mate with bishop and knight]], complete evaluation of [[KPK|king and pawn vs. king]], probably outcome of a [[Pawn Race|pawn race]], [[Rule of the Square|square of the pawn]], [[Wrong color Bishop and rook pawn|bishop and rook pawn of the opposite color]], the [[Philidor Position|Philidor]] and [[Lucena Position|Lucena positions]] and others. Dynamic recognition of minimum mating material, [[Fifty-move Rule|fifty move rule]], and [[Repetitions#RepetitionOfPositions|repetition of position]] assist in forestalling heartbreaking draws in otherwise won positions. The search algorithm uses a [[Depth-First|depth first]], [[Alpha-Beta|alpha-beta]] search with the [[Null Window|zero width window]] technique ([[Principal Variation Search|PVS]]). The search proceeds [[Iterative Deepening|iteratively]] with a quiescence search incorporating [[Captures|captures]] and certain threats appended beyond the [[Depth|nominal depth]]. The program will not perform an [[Evaluation|evaluation]] on a position where either king is [[Check|in check]]. The check must first be resolved by showing the existence of an escape move or [[Checkmate|mate]]. Iterations are finally halted under the direction of a [[Time Management|time control algorithm]] which is dynamically incorporated for up to 40 moves in the root position. Two [[Killer Move|killer moves]] are stored at every [[Ply|ply]]. The program performs a preliminary sort on the ply above the quiescence search. The search is supported by extensive [[Transposition Table|transposition tables]] incorporating random numbers selected using [[BCH Hashing|BCH theory]].
=See also=
* [[Boris Baczynskyj#CrayBlitzFidelity|Book Issues in Cray Blitz - Fidelity X @ ACM 1984]]
* [[Fidelity Electronics]]
* [[Excalibur Electronics]]
* [[Hegener & Glaser]]
* [[Sidney Samole]]
* [[Sargon]]
* [[Dan Spracklen]]
* [[Kathe Spracklen]]
=Fidelity Computers=
* [[Chess Challenger]]
* [[Elegance]]
* [[Elite]]
* [[Excel]]
* [[Excellence]]
* [[Fidelity]]
* [[Fidelity Phantom]]
* [[Par Excellence]]
* [[Private Line]]
=External Links=
==Chess Computers==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=312 Fidelity's ICGA Tournaments]
* [http://www.flickr.com/photos/10261668@N05/sets/72157600922170604/ Fidelity | Photo collection] by [[Steve Blincoe|Chewbanta]]
==Misc==
* [https://en.wikipedia.org/wiki/Fidelity Fidelity from Wikipedia]
* [https://en.wikipedia.org/wiki/Fidelity_(disambiguation) Fidelity (disambiguation) from Wikipedia]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Dedicated]]
