Parallel Automated Knowledge Acquisition of Case-Based Semantic Networks from Relational Databases. Rotated Bitmaps, a New Twist on an Old Idea. Book Learning - a Methodology to Tune an Opening Book Automatically. The Dynamic Tree-Splitting Parallel Search Algorithm. Deep Blue: Opening Book vs, Opening Book. The DTS high-performance parallel tree search algorithm. Computer Chess: What Remains? ICCA Journal, Vol. Chess and supercomputers: details about optimizing Cray Blitz.
Robert Hyatt, Albert Gower, Harry Nelson ( 1990). A Parallel Alpha-Beta Tree Searching Algorithm. Thesis, Department of Computer Science, University of Alabama at Birmingham A High-Performance Parallel Algorithm to Search Depth-First Game Trees. Robert Hyatt, Harry Nelson, Albert Gower ( 1986). Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective, p. Using Time Wisely, revisited (extended abstract). Robert Hyatt, Albert Gower, Harry Nelson ( 1985). Master's Thesis, University of Southern Mississippi Cray Blitz - A Computer Chess Playing Program. Proceedings of ACM SE Regional Conference, Atlanta, Georgia. James Swafford, Charles Roberson, Bob and Brian Richardson watching ACCA 2007 Selected Publications He is active poster in Computer Chess Forums, served as moderator of CCC, and as member of the Secretariat of ICGA Investigations. Beside research and publications on parallel search, transposition table, time management and book learning, Bob is inventor of rotated bitboards. He was primary author of Blitz and Cray Blitz, the two-time winner of the World Computer Chess Championship, the WCCC 1983 and the WCCC 1986. His engine Crafty was the strongest open source engine for many years in the 90's and early 00's. from UAB in 1988 on the topic of parallel search. He holds a Master of Science from University of Southern Mississippi in 1983 with a thesis on Cray Blitz, and a Ph.D. Bob Hyatt is one of the most active researchers in computer chess, being involved from 1968 until the present. According to Wired, the move that threw Kasparov off his game and changed the momentum of the match was not a feature, but a bug.An American computer scientist, computer chess researcher, chess programmer, acknowledged computer chess authority, and associate professor at Faculty of Computer and Information Sciences, University of Alabama at Birmingham, since September 2016 officially retired from UAB. What it may have been, in fact, was a glitch in Deep Blue’s programming: Faced with too many options and no clear preference, the computer chose a move at random. He later said he was again riled by a move the computer made that was so surprising, so un-machine-like, that he was sure the IBM team had cheated. Kasparov, according to NPR, was visibly perturbed - sighing and rubbing his face - before he abruptly stood and walked away, forfeiting the match. Although he easily won the first game, Deep Blue dominated the second. Once again, the psychological toll of facing off against an inscrutable opponent played a key role. The next year, he played against a new and improved Deep Blue and lost the match. So although I think I did see some signs of intelligence, it’s a weird kind, an inefficient, inflexible kind that makes me think I have a few years left.” He boasted, “In the end, that may have been my biggest advantage: I could figure out its priorities and adjust my play. Knowing that it was still basically a calculating machine gave Kasparov his edge back. Later, he discovered the truth: Deep Blue’s calculation speed was so advanced that, unlike other computers Kasparov had battled before, this one could see the material advantage of losing a pawn even if the advantage came many moves later. I could feel - I could smell - a new kind of intelligence across the table.” “I had played a lot of computers but had never experienced anything like this. “It was a wonderful and extremely human move,” Kasparov noted, and this apparent humanness threw him for a loop. He later explained, in an essay for TIME, that Deep Blue flummoxed him in that first game by making a move with no immediate material advantage nudging a pawn into a position where it could be easily captured. But after rallying to beat Deep Blue, winning three matches and drawing two after his initial loss, Kasparov wasn’t ready to give up on the human race - or himself.
0 kommentar(er)
