Revision as of 04:16, 7 January 2009 editDGG (talk | contribs)316,874 edits indicates considerable importance, so not a speedy.← Previous edit | Revision as of 17:13, 11 January 2009 edit undoOctogenarian 1928 (talk | contribs)49 edits →I like the checkers info and it should remainNext edit → | ||
Line 1: | Line 1: | ||
{{Infobox chess player | {{Infobox chess player | ||
|playername = Ed Trice | |playername = Ed Trice | ||
Line 8: | Line 7: | ||
|placebirth = {{flagicon|Pennsylvania}} ], ] | |placebirth = {{flagicon|Pennsylvania}} ], ] | ||
}} | }} | ||
'''Edward A. Trice''' (born ], ] in ], ]) is an ] ] and ]. He invented a ] known as ], and has created several ] and ] ]. He is a ] rated Class-D ] player with a ] of 1303.<ref></ref> He is also a Gothic Chess expert with a Gothic Chess rating of 2046.<ref>http://www.gothic-chess.com/players-games.php</ref> | '''Edward A. Trice''' (born ], ] in ], ]) is an ] ] and ]. He invented a ] known as ], and has created several ] and ] ]. He also assisted ] in finding the solution to the game of checkers. <ref name="IUCN" /> He is a ] rated Class-D ] player with a ] of 1303.<ref></ref> He is also a Gothic Chess expert with a Gothic Chess rating of 2046.<ref>http://www.gothic-chess.com/players-games.php</ref> | ||
==Early career== | ==Early career== | ||
Line 23: | Line 22: | ||
Trice authored several research papers in the domain of ] that were published by the ], one of which was also published in the hardback textbook, ''Advances In Computer Games 10''. Trice was able to demonstrate that it was possible for a checkers program to fail to win a theoretically won position with as few as seven pieces on the board (four for the winning side, three for the side that should lose). The ''World Championship Checkers'' program was the only software package capable of strongly solving over 19 billion checkers endgames, so it could win where other programs could not do so. | Trice authored several research papers in the domain of ] that were published by the ], one of which was also published in the hardback textbook, ''Advances In Computer Games 10''. Trice was able to demonstrate that it was possible for a checkers program to fail to win a theoretically won position with as few as seven pieces on the board (four for the winning side, three for the side that should lose). The ''World Championship Checkers'' program was the only software package capable of strongly solving over 19 billion checkers endgames, so it could win where other programs could not do so. | ||
==Recent career== | |||
Most recently, Trice was acknowledged with providing help with ] solution to the game of checkers.<ref name="IUCN">{{cite web|author=Dr. Jonathan Schaeffer|url=http://www.cs.ualberta.ca/~chinook/thankyou/|title=Credit for Solving the Game of Checkers|accessdate=27 July|accessyear=2007|}}</ref> With a ] of 500,995,484,682,338,672,639 unique legal positions, checkers is the largest ].<ref name="tcr">{{cite web|author=Dr. Jonathan Schaeffer|year=|title=Checkers is Solved|publisher=|accessdate=2007-07-27|url=http://www.sciencemag.org/cgi/rapidpdf/1144079v1.pdf?ijkey=jVmVcXy2/NTnY&keytype=ref&siteid=sci}}</ref> | |||
==Footnotes== | ==Footnotes== | ||
Line 60: | Line 62: | ||
| Access-date = ], ] | | Access-date = ], ] | ||
}}. | }}. | ||
* {{Harvard reference | |||
| Surname1 = | |||
| Given1 = | |||
| Year = | |||
| Title = Computer Solves Checkers | |||
| Journal = | |||
| Publisher = ABC News | |||
| URL = http://abcnews.go.com/Technology/story?id=3394382&page=1 | |||
| Access-date = ], ] | |||
}}. | |||
* {{Harvard reference | |||
| Surname1 = | |||
| Given1 = | |||
| Year = | |||
| Title = The Next Jump in Artificial Intelligence | |||
| Journal = | |||
| Publisher = Discover Magazine | |||
| URL = http://discovermagazine.com/2007/jul/the-next-jump-in-artificial-intelligence | |||
| Access-date = ], ] | |||
}}. | |||
* {{Harvard reference | |||
| Surname1 = | |||
| Given1 = | |||
| Year = | |||
| Title = Computers Solve Checkers—It's a Draw | |||
| Journal = | |||
| Publisher = Scientific American | |||
| URL = http://sciam.com/article.cfm?articleID=DBE35D70-E7F2-99DF-3ECB392CEF7AC028&chanID=sa003&ec=ab266_0719 | |||
| Access-date = ], ] | |||
}}. | |||
* {{Harvard reference | |||
| Surname1 = | |||
| Given1 = | |||
| Year = | |||
| Title = Is the Only Winning Move Not to Play? | |||
| Journal = | |||
| Publisher = The New York Times | |||
| URL = http://thelede.blogs.nytimes.com/2007/07/19/is-the-only-winning-move-not-to-play/ | |||
| Access-date = ], ] | |||
}}. | |||
* {{Harvard reference | |||
| Surname1 = | |||
| Given1 = | |||
| Year = | |||
| Title = Computer wears the crown in checkers | |||
| Journal = | |||
| Publisher = The Los Angeles Times | |||
| URL = http://www.latimes.com/news/science/la-sci-checkers20jul20,0,884306.story?coll=la-home-center | |||
| Access-date = ], ] | |||
}}. | |||
</div> | </div> | ||
Revision as of 17:13, 11 January 2009
Ed Trice | |
---|---|
Full name | Edward A. Trice |
Country | United States |
Edward A. Trice (born December 5, 1966 in Philadelphia, Pennsylvania) is an American inventor and entrepreneur. He invented a chess variant known as Gothic chess, and has created several chess and checkers programs. He also assisted Jonathan Schaeffer in finding the solution to the game of checkers. He is a USCF rated Class-D chess player with a rating of 1303. He is also a Gothic Chess expert with a Gothic Chess rating of 2046.
Early career
Trice wrote a chess program called The Sniper, which in April 1987, was the first software program to eclipse the Elo performance rating of 2200, which is equivalent to that of "United States Chess Federation Master". The Sniper achieved this roughly four years after the Belle chess machine, created by Ken Thompson, became the first ever hardware machine to earn the Master title. The Sniper ran on processors no faster than 16 MHz, and only lost to players Stephan Rakowsky and Mark Eidemiller, who were both rated over 2300 at the time.
Trice also co-authored the checkers program named World Championship Checkers with Gil Dodgen. After Gil had learned that Trice had defeated the World Champion Chinook checkers program twice in one day, the two collaborated and produced the strongest commercially available checkers software from 1997-2001. This was not the only Computer World Champion program Trice had defeated. In 1989, he won an exhibition game against the Deep Thought chess program, after chief programmer Feng-hsiung Hsu challenged his commentary that there appeared to be an error in its opening book. Ed remarked that even though the program had won a pawn, it would lose the game if it played the same way against him. Feng started the game from the position in question, and on move 20, Deep Thought resigned, its quickest loss ever.
Gothic Chess
Main article: Gothic ChessIn 2000, Trice created the commercial chess variant Gothic Chess, derived from Capablanca Chess. This variant differs from Capablanca Chess in the initial positioning of some of the back-row pieces.
Collaborating again with Gil Dodgen, Trice produced a Gothic Chess program named Gothic Vortex, which was based on the Chess playing program Crafty by Robert Hyatt. In 2004, the first ever Gothic Chess Computer World Championship was held, fielding entrants from four different countries. Gothic Vortex, with its ability to announce checkmate from a distance of 268 moves, won by the score of 14-0.
Trice authored several research papers in the domain of artificial intelligence that were published by the ICGA Journal, one of which was also published in the hardback textbook, Advances In Computer Games 10. Trice was able to demonstrate that it was possible for a checkers program to fail to win a theoretically won position with as few as seven pieces on the board (four for the winning side, three for the side that should lose). The World Championship Checkers program was the only software package capable of strongly solving over 19 billion checkers endgames, so it could win where other programs could not do so.
Recent career
Most recently, Trice was acknowledged with providing help with Dr. Jonathan Schaeffer's solution to the game of checkers. With a game complexity of 500,995,484,682,338,672,639 unique legal positions, checkers is the largest weakly solved game.
Footnotes
- ^ Dr. Jonathan Schaeffer. "Credit for Solving the Game of Checkers". Retrieved 27 July.
{{cite web}}
: Check date values in:|accessdate=
(help); Cite has empty unknown parameter:|1=
(help); Unknown parameter|accessyear=
ignored (|access-date=
suggested) (help) - USCF MSA - Member Details (Tournament History)
- http://www.gothic-chess.com/players-games.php
- "The Sniper Compx". US Chess Federation. Retrieved 2007-07-27.
- Stephan Rakowsky at the US Chess Federation site.
- Mark Eidemiller at the US Chess Federation site.
- "World Championship Checkers [[website]]". Retrieved 2007-07-27.
{{cite web}}
: URL–wikilink conflict (help) - "Chinook Wall of Honor". University of Alberta: Department of Computing Science. February 27, 2002. Retrieved 2007-07-27.
{{cite web}}
: Check date values in:|date=
(help) - Ed Trice vs. Deep Thought
- "Ed Trice vs. Susan Polgar". Retrieved 2007-10-25.
- Gothic Chess Computer World Championship results.
- Dr. Jonathan Schaeffer. "Checkers is Solved" (PDF). Retrieved 2007-07-27.
References
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.
- Template:Harvard reference.