Home  - Math_Discover - Computer Chess

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

41-60 of 147    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20

Computer Chess:     more books (100)

Computers in Chess: Solving Inexact Search Problems (Symbolic Computation / Artificial Intelligence) by M. M. Botvinnik, 1983-11-29 Computers, Chess and Long-Range Planning. (Heidelberg Science Library) by Michail M. Botvinnik, 1970-07-08 Chess Skill in Man and Machine Computers and Games: 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) Computers and Games: Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers (Lecture Notes in Computer Science) The Machine Plays Chess (Pergamon Chess Series) by A. G. Bell, 1978-02 Computers and Games: 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence) by Ernst A. Heinz, 1999-12 Computers and Games: 6th International Conference, CG 2008 Beijing, China, September 29 - October 1, 2008. Proceedings (Lecture Notes in Computer Science ... Computer Science and General Issues) Chess and Machine Intuition by George W. Atkinson, 1998 Forcing Chess Moves: The Key to Better Calculation by Charles Hertan, 2008-04-07 Secrets of a Grandpatzer: How to Beat Most People and Computers at Chess by Kenneth Mark Colby, 1979-01-01 Computer Gamesmanship by David N. L. Levy, 2009-04-15 Computer Games I by David N. L. Levy, 2009-04-10

lists with details

41. WCCC99 - 9th World Computer Chess Championship - WCCC 99 In Paderborn
    http://www.uni-paderborn.de/~wccc99/

42. HIARCS Chess Software For PC, Mac, Pocket PC And Palm Chess
    The strongest and best computer chess software program for PC, Mac Palm PDAs.HiRes, 3D, Superb features for beginners and Grandmasters alike.  
    http://www.hiarcs.com/
    
    Extractions: Playing ability: Absolute beginner (750 Elo) to Strong Grandmaster (2650+ Elo) Palm HIARCS has proven to be significantly stronger than Pocket Fritz 2, Grandmaster, Chess Tiger, Chess Genius and all other Palm and Pocket PC chess software! Palm HIARCS has unlimited realistic weaker opponents catering for all players from absolute beginners, hobby players, club players to professional Grandmasters. The very human-like playing style gives you the practice and experience you need to really improve your chess. Packed with so many more features than any other Palm chess program, Palm Chess HIARCS is really beyond comparison Key features: World's strongest PDA chess program , true GM strength in the Palm of your hand!

43. Omid's Computer Chess Website
    Home of the Genesis chess engine and latest computer chess research by Omid David.  
    http://www.cs.biu.ac.il/~davoudo/
    
    Extractions: In Memory of the Israeli Victims of Terror ... Murphy's laws and corollaries Misc Links MidEast Truth Independent Media Review Analysis (IMRA) Audio / Video Benjamin Netanyahu's speech at Trafalgar Square (Audio) Meet the Press with Benjamin Netanyahu on MSNBC (Video) Political The Western Media Distort the Mideast Picture (Garry Kasparov) High Commissioner Kurtzer (Nathan Netanyahu) ... (Joseph Farah) Welcome to Omid's Computer Chess Website! Email: July 4–12, 2004 4th Conference on Computer and Games Chess engines: Logos by David Dahlem Hello and welcome to my website. I am a Ph.D. Computer Science student at Bar-Ilan University. I used to participate in chess tournaments intensively from a young age (rating of 2250 Elo ), but currently I spend most of my time on computer chess, which was also the subject of my M.Sc. thesis (

44. PC HIARCS 9.0 Computer Chess Software Program
    World Class HIARCS PC computer chess Software Program. Suitable for beginners tosuper Grandmasters!  
    http://www.hiarcs.com/pc_hiarcs_9_0.htm
    
    Extractions: HIARCS 9.0 for PCs The latest version 9.0 of the program has been enhanced and extended in many ways, particularly in terms of implementing concrete chess knowledge and positional learning. With the improved search function, it's now possible to assess positions using new positional criteria such as “typical pawn structures”, “long term plans” and above all “safety of the king”. A better selection of variations provides a greater search depth, enabling Hiarcs 9 to impress by its sharp powerful play against the enemy king as well as its better understanding of endgames, even with unbalanced material. A special asset of Hiarcs 9 is the opening book, which has been finely adjusted to the playing style of the program. This is the work of computer chess expert Eric Hallsworth, who has been developing the Hiarcs opening books for many years. For Hiarcs 9, he has compiled an optimized and many-sided repertoire with a wealth of novelties. Developer Mark Uniacke himself says about his new program: “A major improvement is the king attack enhancements. Hiarcs' play can now be really exciting. Also the learning and the positional understanding has been clearly improved. I suggest to you that the king attack enhancements (the play can be really exciting), learning, positional understanding (Hiarcs has a reputation as a positional player) and the overall strength are now clearly on a par with the top engines.”

45. GNUChess
    GNUChess programming with GNU versions for Atari, Mac, Windows, Unix. Also contains other games that are using chess programming techniques. Java, C, C++ source code included for all games.  
    http://users.telenet.be/artificialintelligence/chess/gnuchess.html
    
    Extractions: This page is pure computer chess (GNU Chess and alike). Go back to the Artificial Intelligence page for the rest of computer chess programming and more general topics. Further down on this page you will find other chess programs. Please find below a table of the different versions and platforms GNU is available on: Download GNU chess source I don't think that Windows is a must for chess algorithm development. It is nice for the user interface. That's all. For the moment, I do not focus on Windows development. If however someone wants to cooperate in some graphical stuff... I think the underlying engine should not be aware of the OS it's running on. So my sources are always portable. The atari version is working. Download GNU chess with interface sources. Source is not maintained by me.. I parted from the Unix source to get this version, but I do not have a Unix version available in order to test my update. So it might need some changes before it can be run again. Mac version There is also a macintosh version available. Please refer to the GNU chess FAQ for more information.

46. MAKING COMPUTER CHESS SCIENTIFIC (20-Sep-1998)
    Kasparov that the tournament oriented work on computer chess was not contributing computer chess and human chess gives an example of a problem quickly  
    http://www-formal.stanford.edu/jmc/chess.html
    
    Extractions: Up to: Main McCarthy page I complained in my Science review of Monty Newborn's Deep Blue vs. Kasparov that the tournament oriented work on computer chess was not contributing as much to the science of AI as it should. AI has two tools for tackling problems. One is to use methods observed in humans, often observed only by introspection, and the other is to invent methods using ideas of computer science without worrying about whether humans do it this way. Chess programming employs both. Introspection is an unreliable way of determining how humans think, but introspectively suggested methods are valid as AI if they work. Much of the mental computation done by chess players is invisible to the player and to outside observers. Patterns in the position suggest what lines of play to look at, and the pattern recognition processes in the human mind seem to be invisible to that mind. However, the parts of the move tree that are examined are consciously accessible. It is an important advantage of chess as a Drosophila for AI that so much of the thought that goes into human chess play is visible to the player and even to spectators. When chess players argue about what is the right move in a position, they follow out lines of play, i.e. argue explicitly about parts of the move tree. Moreover, when a player is found to have made a mistake, it is almost always a failure to follow out a certain line of play rather than a misevaluation of a final position.

47. Peter's Computer Chess Page
    Aug 2003, Article about Warp s win in Australian computer chess Champs appearsin NZ Infotech. Jul 2003, Warp wins Australian computer chess Championshiop.  
    http://homepages.caverock.net.nz/~peter/chess.htm
    
    Extractions: Nov 2004 Added a Links page. Aug 2003 Article about Warp's win in Australian Computer Chess Champs appears in NZ Infotech. Jul 2003 Warp wins Australian Computer Chess Championshiop. Mar 2003 LambChop 10.99 available for download Feb 2003 Added perft page May 2002 LambChop 10.88 available for download Dec 2001 Added endgame test suite. Mar 2001 Re-design of main computer chess page and tidy up of other pages. Other Endgame Test Perft PGNres Links

48. Guide To The Use Of Computer Chess Endgame Tablebases
    Answers common questions regarding endgame tablebases for use in chessprograms.Covers nalimov tablebases.  
    http://www.aarontay.per.sg/Winboard/egtb.html
    
    Extractions: by ChangeDetection (My PGP key) Introduction This page was initially part of my web site on setting up of Winboard engines . However, I discovered that many visitors to my site, were actually looking for information on setting up endgame tablebases. Given the fact that my Winboard web site was already very long, I decided to start a new web site using the information already available in the original page as a base. I added information from the various web sites and past posts at Rec.games.chess.computer and the Computer Chess Club. I'm a layman who is largely unfamiliar with the technical details of endgame tablebases. As such much of the technical detail here is only available thanks to the kind permission of experts such as E.A. Heinz,Guy Haworth, (both frequent contributors to ICGA journals on this topic) Anders Thulin (from rec.games.chess.computer ) , Robert Hyatt, Bruce Moreland and especially Dieter Buerssner (all of those are authors of strong chess programs that use endgame tablebases). I would be grateful if you can email me if you spot any errors.

49. Chessopolis!
    Complete directory with archive, books, clubs, history and computer chess links.  
    http://www.chessopolis.com

50. Beginner's Guide To Running Computer Chess Tournament
    Running a computer chess tournament is a long and thankless task that will tie CCT computer chess Tournament. CCT is similar to the other tournaments  
    http://www.aarontay.per.sg/Winboard/computer.html
    
    Extractions: Running a computer Chess tournament is a long and thankless task that will tie up your computer for days . Many people feel that such tournaments [referred to as "Basement tournaments"] are merely a waste of computational resources. Despite this, many computer Chess enthusiasts still eagerly spend much of their free time running such tournaments and the reasons why they do so vary. Some do it because, they want to assist authors of their favourite programs as beta testers, others do it because they have the need to find out once and for all the best program or to prove a point, and yet others do it because they enjoy watching the computers battle it out and enjoy playing through the resulting Chess games.

51. Computer Chess Programming » Blog Archive » Chess Tree Search
    Reference material, programming techniques, endgame databases, and computer game research for chess programming.  
    http://chess.verhelst.org/1997/03/10/search/
    
    Extractions: Chess Program Sources Computer Chess Books Tree search is one of the central algorithms of any game playing program. The term is based on looking at all possible game positions as a tree, with the legal game moves forming the branches of this tree. The leaves of the tree are all final positions, where the outcome of the game is known. The problem for most interesting games is that the size of this tree is tremendously huge, something like W^D, where W is the average number of moves per position and D is the depth of the tree, Searching the whole tree is impossible, mainly due to lack of time, even on the fastest computers. All practical search algorithms are approximations of doing such a full tree search. These pages give an overview of traditional, fixed depth minimax search, with various refinements such as selective extensions and pruning, as used in most modern chess programs. There are other, more experimental, game tree search techniques that take a different approach, like e.g. B* and conspiracy numbers, which I hope to describe at a later time. This overview covers the follwoing subjects: The various search algorithms are illustrated in a compact pseudo-C. The

52. Computer Chess Develops
    endgame robot Shannon outlined how any chess computer would have to evaluate andchoose future Here s a time line on the development of computer chess.  
    http://whyfiles.org/040chess/main4.html
    
    Extractions: Chess and computers go back a long way, perhaps because both appeal to rule-intensive, highly logical minds. In 1950, Claude Shannon, a scientist at Bell Laboratories, published the article that spawned the field of computer chess. (For a technical but complete history, see "Kasparov versus Deep Blue" in the bibliography. Shannon outlined how any chess computer would have to evaluate and choose future positions. He also gave some suggestions about how far into the future it would have to search a key consideration given the extremely limited talents of the early computers and the fiendish complexity of chess. By that we mean this: In the middle of a game, when many pieces remain in play, each player typically has 30 or 40 moves. So after one move by each player (that's called two "plies," or one "move") the board could show about 1,000 positions. By another complete move, there would be 1 million, and by the third move, 1 billion. That kind of "combinatorial explosion" lead to this phenomenal analysis: that the number of possible unique chess games equals 10 Must we mention this is an embarrassingly big number? Let's write it out:

53. 14.3 Computer Chess
    One might also ask the question, ``Why study computer chess at all? We thinkthe answer lies in the unusual position of computer chess within the  
    http://www.netlib.org/utk/lsi/pcwLSI/text/node341.html
    
    Extractions: Next: 14.3.1 Sequential Computer Chess Up: 14 Asynchronous Applications Previous: 14.2.4 Performance Analysis As this book shows, distributed-memory, multiple-instruction stream (MIMD) computers are successful in performing a large class of scientific computations. As discussed in Section and the earlier chapters, these synchronous and loosely synchronous problems tend to have regular, homogeneous data sets and the algorithms are usually ``crystalline'' in nature. Recognizing this, C P explored a set of algorithms which had irregular structure (as in Chapter ) and asynchronous execution. At the start of this study, we were very unclear as to what parallel performance to expect. In fact, we achieved good speedup even in these hard problems. Thus, as an attempt to explore a part of this interesting, poorly understood region in algorithm space, we implemented chess on an nCUBE-1 hypercube. Besides being a fascinating field of study in its own right, computer chess is an interesting challenge for parallel computers because: It is not clear how much parallelism is actually available-the important method of alpha-beta pruning conflicts with parallelism.

54. Chess Tiger: The Strongest Computer Chess Program For The Palm - Free Download
    Chess Tiger for Palm, the strongest computer chess program available for the Palmcomputing platform can be downloaded for free from this page.  
    http://perso.wanadoo.fr/ct_chess/

55. MacNN | Mac Wins Dutch Computer Chess Championships
    MacNN is the leading source for news about Apple and the Mac industry. It offersnews, reviews, discussion, tips, troubleshooting, links, and reviews every  
    http://www.macnn.com/articles/05/07/21/mac.crowned.chess.champion/
    
    Extractions: The 5th International Dutch Computer Chess championships were held in Leiden, Netherlands from June 3rd to June 5th. The program dubbed "Shredder" running on a dual-2.7GHZ G5 piloted by Stefan Meyer-Kahlen managed to take first place. Competitors had to play nine rounds in three days with a time limit of 90 minutes per game for each side. "Shredder" was in second place after the first day and swept in to take first by day two with 5.5 points out of 6 games. Stefan wrote "The Macintosh version of Shredder performed very well and as far as I know this was the first time that a chess program running on an Apple Macintosh computer has won a major computer chess tournament. The Macintosh hardware has also proved that it is very competitive and fast." Updates on "Shredder" are also available.

56. Computer Chess - Digital Chess Network - Reloaded
    computer chess news from all around the world. A guide on how to write your own chess program and a database with games, interviews, reviews, information on chess programs, and utilities.  
    http://www.digichess.gr/

57. New Scientist Breaking News - New World Computer Chess Champ Crowned
    A new world computer chess champion was crowned at the 2004 finals in Israel But computer chess can still contribute to research in problem solving and  
    http://www.newscientist.com/article.ns?id=dn6144

58. An Introduction To Computer Chess
    computer chess may give a down to earth perspective on what is and is not In 1950, the first computer chess program was written by Alan Turing,  
    http://db.uwaterloo.ca/~alopez-o/divulge/chimp.html
    
    Extractions: UPDATE In this time of ``intelligent'' cameras, electronic games and coffee-makers it seems strange that at some point many computer scientists thought that computers would never be able to perform nontrivial tasks. Even today, many people are still unaware of what computers can and cannot do. It is sometimes amusing to see a scientist's face light up surprise when shown some computer tools that have been available for over a decade (like computer graphics, symbolic mathematics, etc), and their disillusionment when told that computers still can't efficiently perform some apparently simple tasks (simple for a computer) like finding the optimal route to be followed by a courier delivering packages all over the city. The history of computer chess is plagued by similar under-and-overstatements put forward by laypeople and experts alike. Though chess is an ideal problem for computers to attack. Its aims are clearly defined (to play good chess) and its advancement can be easily measured (player ranking). Computer chess may give a down to earth perspective on what is and is not currently possible with a computer and how much effort it may take to achieve an specific goal in computer development.

59. Guardian Unlimited | Technology | Do Not Pass Go
    The qualifying match itself provoked surprise in the computer chess community, The Israeli program is the reigning World computer chess Champion,  
    http://www.guardian.co.uk/online/story/0,3605,817484,00.html
    
    Extractions: Read today's paper Sign in Register Go to: Guardian Unlimited home UK news World news Newsblog Archive search Arts Books Business EducationGuardian.co.uk Film Football Jobs MediaGuardian.co.uk Money The Observer Politics Science Shopping SocietyGuardian.co.uk Sport Talk Technology Travel Been there Audio Email services Special reports The Guardian The northerner The wrap Advertising guide Crossword Soulmates dating Headline service Syndication services Events / offers Help / contacts Feedback Information GNL press office Living our values Newsroom Reader Offers Style guide Travel offers TV listings Weather Web guides Working at GNL Guardian Weekly Money Observer Public Home Technology blog Ask Jack blog Gamesblog ... Science Ever since Garry Kasparov's sensational 1997 loss to the IBM chess monster Deep Blue, the chess world has thirsted for revenge. But the first opportunity ended in failure in Bahrain on Saturday, when Kasparov's former pupil and successor as World Champion, Vladimir Kramnik, could only draw an 8-game match against one of the world's leading chess engines, Fritz. But this was just the latest in a long series of human versus computer encounters that illustrate the inexorable march of artificial intelligence (AI). It's a story that began at a Dartmouth University conference in 1956, when several of the founding fathers of AI defined the goals of that infant science. One of them was to create a computer program that could defeat the world chess champion. Success would, those scientists believed, reach to the very core of human intellectual endeavour.

60. Computer Go Vs. Computer Chess
    Why is computer Go hard, why is computer chess easy? The real stumbling block inGo is developing a workable set of heristics to model the playing process.  
    http://www.andromeda.com/people/ddyer/go/chess-vs-go.html
    
    Extractions: Why is computer Go hard, why is computer Chess easy? The real stumbling block in Go is developing a workable set of heristics to model the playing process. However, this is the problem because it's a given that brute force is out of the question. In chess programs, brute force is the only strategically or tactically significant factor in playing strength. The cleverness in chess programs is 95% directed toward doing brute force searches more efficiently. This *does* involve significant knowledge about chess, but in the end the knowledge is used mainly to order the search tree more efficiently. If the knowledge is faulty, the bad effect is that the search becomes less efficient. The moves chess programs ultimately make are almost completely dominated by counting the wood at the bottom of the search tree. In effect, the search is used to distill the rough knowledge into high potency play. On the other hand, in go programs the knowledge is all there is, because the search is impossible; so every little flaw in the the playing heuristics remains a visible flaw in the program. comments/suggestions to: ddyer@real -me.net

41-60 of 147    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20