Forward checking - artificial intelligence, Computer Engineering

Assignment Help:

Forward checking:

Whether to add some sophistication to the search method there constraint solvers use a technique called as forward checking. So here the general idea is to work the like as a backtracking search but, where checking compliance with constraints behind assigning a  value to a variable there the agent also checks when this assignment is going to break constraints with  future variable assignments. Hence is supposing that Vc has been assigned to the current variable c, after then for each unassigned variable xi, as temporarily remove all values from Di that along with Vc break a constraint. Thus it may be that in doing so, Di becomes empty. Because the choice of Vc for the current variable is bad  -  so however it will not find its way into a solution to the problem just because there's no way to assign a value to xi without breaking a constraint. In that condition even though the assignment of Vc may not break any constraints such that already assigned variables so a new value is chosen as or backtracking occurs whether there are no values left, just because we know that V  is a bad assignment. 

Here the next diagram like again, taken from Smith's tutorial to shows how forward checking improves the search for a solution to the 4-queens problem as;:. 

2484_Forward checking.png

In such a scenario to forward checking, to improve the intelligence of the constraint solving agent so there are some possibilities for a heuristic search. Therefore firstly, our agent can worry about the order such that looks at the variables, that is, in example of the 4-queens problem so it might try to put a queen in row 2, after then one in row 3, one in row 1 and then finally one in row 4. Moreover a solver taking such care is said to be utilizing a variable-ordering heuristic. Conversely the ordering of variables can be done earlier than a search  is started and rigidly adhered to during the search. In fact this might be a good idea whether there is extra knowledge about the problem, like an example that a particular variable should be assigned a value sooner quite than later. In such a scenario  the ordering of the variables can be done dynamically so in response to some information gathered about that how the search is progressing during the search procedure.


Related Discussions:- Forward checking - artificial intelligence

Explain handlers classification, Handlers Classification In 1977, Wolfg...

Handlers Classification In 1977, Wolfgang Handler suggested a complex notation for representing the pipelining and parallelism of computers. Handler's categorization addresses

Security, We now consider the relation between passwords and key size. For ...

We now consider the relation between passwords and key size. For this purpose consider a cryptosystem where the user enters a key in the form of a password. Assume a password consi

Explain the working of master-slave JK flip flop, With relevant diagram exp...

With relevant diagram explain the working of master-slave JK flip flop. Ans. Master-Slave J-K FLIP-FLOP: A cascade of two S-R FLIP-FLOPS is a master-slave J-K FLIP-FLOP. One

Explain the term - ancestors, Explain the term - ancestors The ancestor...

Explain the term - ancestors The ancestors of modern age computer were mechanical and electro-mechanical instruments. This ancestry can be traced as back and seventeenth centur

Define the time required by sector to reach below read/write, is the time r...

is the time required by a sector to reach below read/write head. Latency Time is the time needed by a sector to reach below read/write head.

When recursion functions are declared inline, Describe what happens when re...

Describe what happens when recursion functions are declared inline? Ans) Inline functions property says whenever it will call; it will copy the whole definition of that functi

Determine why a new system is required, Q. Determine why a new system is re...

Q. Determine why a new system is required? Feasibility Study: - Feasibility study is the method of defining the current problem determining why a new system is essential and

Bit manipulation techniques and mathematical functions, Within micro contro...

Within micro controller's software, it is very useful to be able to manipulate binary bits i.e. from ports etc. The ALU has command to shift data, rotate data, compare data, set/cl

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

What is high level formatting, Q. What is High level formatting? In any...

Q. What is High level formatting? In any disk system the space at some time in use would become discarded and therefore will be free for other application. Operating system ass

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd