--%>

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 : MANOVA and Reflection Activity

    Activity 10:   MANOVA and Reflection   4Comparison of Multiple Outcome Variables This activity introduces you to a very common technique - MANOVA. MANOVA is simply an extension of an ANOV

  • Q : Derived quantities in Queuing system

    Derived quantities in Queuing system: • λ = A / T, Arrival rate • X = C / T, Throughput or completion rate • ρ =U= B / T, Utilization &bu

  • Q : Sample Questions in Graphical Solution

    Solved problems in Graphical Solution Procedure, sample assignments and homework Questions: Minimize Z = 10x1 + 4x2 Subject to

  • Q : Decision Variables Determine Decision

    Determine Decision Variables: Let X1 be the number of private homes to be inspectedLet X2 be the number of office buildings to be inspect

  • Q : Define Service Demand Law

    Service Demand Law:• Dk = SKVK, Average time spent by a typical request obtaining service from resource k• DK = (ρk/X

  • Q : What is Inter-arrival times

    Inter-arrival times:A) Requests arrive randomly, often separated by small time intervals with few long separations among themB) The time until the next arrival is independent of when the last arrival occurredC) Coro

  • Q : What is Forced Flow Law Forced Flow Law

    Forced Flow Law: • The forced flow law captures the relationship between the various components in the system. It states that the throughputs or flows, in all parts of a system must be proportional t

  • Q : Define Utilization Law Utilization Law

    Utilization Law: • ρk = XK . SK = X . DK • Utilization of a resource is the fraction

  • Q : Use the NW corner rule to find an

      (a) Use the NW corner rule to find an initial BFS, then solve using the transportation simplex method. Indicate your optimal objective function value. (b) Suppose we increase s1 from 15 to 16, and d3 from 10 to 11. S

  • 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 <