--%>

Computers playing games

How Computers playing games can be categorized according to different dimensions?

E

Expert

Verified

Computers playing games:

Competing against each other in the form of a game is nothing new. Egyptians and Chinese have archived games which date back to far before the year zero. Games can be categorized according to different dimensions. Three examples are:

(1) the number of players,

(2) whether chance is involved, and

(3) how many information a player has.

With the upcoming of computers human beings were tempted to let the computer play those games. The reason why scientists are interested in research on board games is that the rules of games are mostly exact and well defined which makes it easy to translate them to a program that is suitable for a computer to run (Van den Herik, 1983). The research in board games obtained a huge impulse in 1944 when Von Neumann republished his article about the minimax algorithm (Von Neumann, 1928) together with Morgenstern in the book “Theory of Games and Economic Behavior” (Von Neumann and Morgenstern, 1944). These ideas were picked up by Shannon (1950) and Turing (1953) who tried to let a computer play Chess as intelligently as possible. Since then much research is performed on new methods, on a variety of games (Murray, 1952) and on other problems to make the computer a worthy opponent for the human player (Schaeffer and Van den Herik, 2002). One field in this area of research are the board games which have full information and are played by two persons. Chess is the classical example of this kind of a game and a great deal of effort has been devoted in the past to the construction of a good chess player. The most pregnant success so far in this area was the result when Deep Blue achieved to win against world chess champion Garry Kasparov (Newborn, 1996).

   Related Questions in Basic Statistics

  • Q : What is Interactive Response Time Law

    Interactive Response Time Law: • R = (L/X) - Z• Applies to closed systems.• Z is the think time. The time elapsed since&nb

  • Q : Report on Simple Random Sampling with

    One of my friend has a problem on simple random sampling. Can someone provide a complete Report on Simple Random Sampling with or without replacement?

  • Q : Calculate the p- value Medical tests

    Medical tests were conducted to learn about drug-resistant tuberculosis. Of 284 cases tested in New Jersey, 18 were found to be drug- resistant. Of 536 cases tested in Texas, 10 were found to be drugresistant. Do these data indicate that New Jersey has a statisti

  • Q : Designing a system What are the

    What are the questions that comes into mind when designing a system?

  • Q : Safety and Liveness in Model Checking

    Safety and Liveness in Model Checking Approach; •? Safety: Nothing bad happens •? Liveness: Something good happens •? Model checking is especially good at verifying safety and liveness properties    –?Concurrency i

  • Q : Write out the null hypothesis 1.

    1. (AAC/ACA c9q1).  For each of the following studies, decide whether you can reject the null hypothesis that the groups come from identical populations. Use the alpha = .05 level.1a.

  • Q : Define Operational Analysis

    Operational Analysis: • Analysis method based on the measurement of the operational characteristics of the system.

    Q : Define SPIN simulation modes SPIN: •

    SPIN: • SPIN generates C program that is the model checker – The pan verifier • Process Analyzer – Run the pan executable to do the model check

  • Q : Quantities in a queuing system

    Quantities in a queuing system: A: Count of

  • Q : Problem on queuing diagram Draw a 

    Draw a queuing diagram for the systems below and describe them using Kendall’s notation: A) Single CPU system <

  • ©TutorsGlobe All rights reserved 2022-2023.