The mouse trap
The Economist (London),
07/1994, Letnik:
332, Številka:
7874
Magazine Article
World champion chess player Gary Kasparov's recent loss to a computer chess program, Pentium-Fritz 3, has led some to suggest that computers are now the best chess players in the world. In fact, ...while chess programs are vastly superior to humans in tactics, human players are still better at strategy.
Chess is too easy Bringsjord, Selmer
Technology review (1998),
03/1998, Letnik:
101, Številka:
2
Magazine Article
Computer science is of 2 minds about artificial intelligence (AI). Some computer scientists believe in so-called "Strong" AI, which holds that human thought is completely algorithmic, that is, it can ...be broken down into a series of mathematical operations. Others embrace "Weak" AI, the notion that human thought can only be simulated in a computational device. Creativity may be the real issue in Strong versus Weak AI. The test proposed is whether a computer can tell a story. An artificial agent named Brutus.1 is capable of writing short short stories based on the notion of betrayal because its creators were able to devise a formal mathematical definition of betrayal and endow Brutus.1 with the concept. Believers in Weak AI will seek to engineer systems that will create richly drawn characters. But first-rate storytelling will probably always be the sole province of human masters.
Stanislaw Ulam's chess-playing programs raised important questions about what humans do when they think and whether machines would ever be able to think in this way. Chess-playing programs of today ...have been created with the use of brute calculation, which can produce surprisingly humanlike chess.
A security analysis of the Internet Chess Club Black, J.; Cochran, M.; Gardner, R.
IEEE security & privacy,
2006-Jan.-Feb., 2006-01-00, 20060101, Letnik:
4, Številka:
1
Magazine Article
The Internet Chess Club (ICC) is a popular online chess server that started its existence in the early 1990s as the Internet chess server. Although the ICC Web site assures its users that the ...security protocol employed between the client and the server protects sensitive information, the authors show that this isn't true. This article examines two security aspects of the ICC. In moving from a free service to a commercial one, ICC's administrators introduced several enhancements to the original system, including time-stamping, a network security protocol, and online payments.
COKO III Kozdrowicki, Edward W.; Cooper, Dennis W.
Communications of the ACM,
07/1973, Letnik:
16, Številka:
7
Magazine Article
OKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of .2 sec cpu time per move, with a level close to lower chess club play. A ...selective tree searching procedure controlled by tactical chess logistics allows a deployment of multiple minimal game calculations to achieve some optimal move selection. The tree searching algorithms are the heart of COKO's effectiveness, yet they are conceptually simple. In addition, an interesting phenomenon called a tree searching catastrophe has plagued COKO's entire development just as it troubles a human player. Standard exponential growth is curbed to a large extent by the definition and trimming of the Fisher set. A clear distinction between tree pruning and selective tree searching is also made. Representation of the chess environment is described along with a strategical preanalysis procedure that maps the Lasker regions. Specific chess algorithms are described which could be used as a command structure by anyone desiring to do some chess program experimentation. A comparison is made of some mysterious actions of human players and COKO III.
