Computers playing games
How Computers playing games can be categorized according to different dimensions?
Expert
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).
What are the questions that comes into mind when designing a system?
Creating Grouped Frequency Distribution: A) At first we have to determine the biggest and smallest values. B) Then we have to Calculate the Range = Maximum - Minimum C) Choose the number of classes wished for. This is generally between 5 to 20. D) Find out the class width by dividing the range b
Interactive Response Time Law: • R = (L/X) - Z• Applies to closed systems.• Z is the think time. The time elapsed since&nb
Service Demand Law:• Dk = SKVK, Average time spent by a typical request obtaining service from resource k• DK = (ρk/X
Queuing theory: • Queuing theory deals with the analysis of lines where customers wait to receive a service: Q : Sample z test and Sample t test A A random sample X1, X2, …, Xn is from a normal population with mean µ and variance σ2. If σ is unknown, give a 95% confidence interval of the population mean, and interpret it. Discuss the major diff
A random sample X1, X2, …, Xn is from a normal population with mean µ and variance σ2. If σ is unknown, give a 95% confidence interval of the population mean, and interpret it. Discuss the major diff
1. If the mean number of hours of television watched by teenagers per week is 12 with a standard deviation of 2 hours, what proportion of teenagers watch 16 to 18 hours of TV a week? (Assume a normal distribution.) A. 2.1% B. 4.5% C. 0.3% D. 4.2% 2. The probability of an offender having a s
Assumptions in Queuing system: • Flow balance implies that the number of arrivals in an observation period is equal to the
Explain differences between Cumulative Frequency and Relative Frequency?
18,76,764
1939508 Asked
3,689
Active Tutors
1421897
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!