Cut-off search - artificial intelligence, Computer Engineering

Cut-off Search:

By using  a minimax search, all we have to do is program, in a game playing situation our agent to look at the whole  search tree from the current state of the game, and select the minimax solution before making a move. Unluckily, only in very trivial games like  the one above is it possible to calculate the minimax answer all the way from the end states in a game. So, for games of higher complexity, we are forced to estimate the minimax option for world states using an evaluation function. Of course, this is a heuristic function .

In a normal minimax search, we write down the whole search space and then propogate the scores from the goal states to the top of the tree so that we can choose the best move for a player. In a cut off search, however, we write down the entire search space up to a specific depth and then note down the evaluation function for each of the states at the bottom of the tree. We then propagate   these values from the bottom to top the same way in exactly ,as minimax.

In advance, the depth is decided to ensure that the agent does not take too long to select a move.if it has longer, then we permit it to go deeper. If our agent has a given time restriction for each move, then it makes sense to enable it to continue searching until the time runs out. There are several ways to do the search in such a way that a game playing agent searches as much as possible in the time available. For an exercise, what possible ways can you find out of to perform this search? It is essential to bear in mind that the point of the search is not to find a node in the above graph but it is  to determine which move the agent should make.


Posted Date: 10/2/2012 3:41:04 AM | Location : United States

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

Write discussion on Cut-off search - artificial intelligence
Your posts are moderated
Related Questions
Define main memory and auxiliary memory? The memory unit that communicates directly with the cpu is known as main memory [RAM].Devices that give backup storage are known as aux

Forward Chaining - Artificial intelligence: Imagine we have a set of axioms which we know are true statements regarding the world. If we set these to each be a starting state o

Current Pentium 4 based MPUs use Hyper-threading, but the next-generation cores, Woodcrest and Merom, Conroe will not. While some have alleged that this is because Hyper-threading

Opening Files for Reading Only     : A data file is a file that you can open and read its contents visually - for example, C source files, .dat files, HTML etc - anything that look

A NULL pointer is a pointer of any type whose value is zero. A void pointer is a pointer to an object of an unknown type, and is guaranteed to have sufficient bits to hold a pointe

Two Layer Artificial Neural Networks: However decision trees are whenever powerful they are as a simple representation scheme. Whereas graphical on the surface that they can b

What is cache memory? The small and fast RAM units are known as caches. When the implementation of an instruction calls for data located in main memory, the data are obtained a

First-Order Inference Rules: Here now we have a clear definition of a first-order model is that we can define soundness for first-order inference rules in the same way such we

Factor which helps in analysis of parallel algorithms is the total number of processors needed to deliver a solution to a provided problem. So for a given input of size let's say n