Cutoff search - artificial intelligence, Computer Engineering

Cutoff Search :

To require a mini and max search in a game on stage situation is, in which all we have is just do that programme our agent to look at the intact that search tree from the current state of the game, and choose the mini and max solution just before making a move. Regrettably only if in mostly trivial games like the one above is it mostly possible and again possible to calculate the mini-max answer all the way from the end states in a game. Then we considered that, to games of higher complication we are forced to estimate the mini--max choice for world states need such an evaluation function. This is, palpably a heuristic function like as those we discussed in the lecture on search.

During just in a normal mini--max search, we also write down the whole search space and then propogate the scores from the goal states to the top of the tree that the best move for a player, we can choose for this. In a cutoff search, forever, our capacity to write down the complete search space up to a justify depth, after then write down the evaluation function at the bottom of the tree for each of the states. So that we will propagate these values from the bottom to the top in right the matching way as minimax.

Posted Date: 1/10/2013 5:03:21 AM | Location : United States







Related Discussions:- Cutoff search - artificial intelligence, Assignment Help, Ask Question on Cutoff search - artificial intelligence, Get Answer, Expert's Help, Cutoff search - artificial intelligence Discussions

Write discussion on Cutoff search - artificial intelligence
Your posts are moderated
Related Questions

Name two special purpose registers. Index register Stack pointer

What are conditional chain statement? ON CHAIN-INPUT similar to ON INPUT. The ABAP/4 module is called if any one of the fields in the chain having a value other than its in

In the data parallel model, many of the parallel work focus on performing operations on a data set. The data set is usually organized into a common structure, such as an array or a

Q. Perform division in binary showing contents of accumulator, B register and Y register during each step. (Accumulator, B, Y are 5-bit registers) 13 / 2

pebble merchant

What is Thread? A thread, sometimes termed a lightweight process (LWP), is a fundamental unit of CPU utilization; this comprises a thread ID, a register set, a program counter

RAM: Read / Write memory, High Speed, Volatile Memory. ROM: Read only memory, Low Speed, Non Voliate Memory.   RAM- Random Access memory it is a Volatile Memory.  volatil

Q. Illustration of cache size of a system? Cache Size: Cache memory is very costly as compared to main memory and therefore its size is generally kept very small.  It has bee

Perform multiplication with showing the contents of accumulator, B register and Y register during each step. (Accumulator, B, Y are 4-bit registers) B=06 Y=02