BlogsForWorld

Domain Knowledge  Knowledge about the problem domain which helps the designer to decide the heuristic function and their values. For example looking at the chess board position, a good heuristic function can state if this position is good or bad and how much. Heuristic function  a function which takes the game position as an input and tells how good or bad it for the player. Usually a quantified value between -10 and 10 are returned. 10 indicates a win for the player, -10 indicates the defeat and any other value describes the goodness of the position with respect to the value returned. The value returned by hashing function indicates the merit of that state. Hill Climbing  a heuristic search method which takes any next move which is better than the current based on the heuristic function’s value Local Maxima  when a heuristic search function returns lower values for all neighbours and the current node is not a goal node, th...

ARTIFICIAL INTELLIGENCE The first problem is called 3-4 gallon water jug problem as described in the book by Elaine Rich. We begin with two empty jugs of the capacity of 3 and 4 gallons respectively. We have an infinite supply of water available and we want the 4-gallon jug to be filled with exactly 2 gallons of water. Another problem is called 8-5-3 milk jug problem which begins with 8-gallon milk jug completely full while other two are empty. We want exactly 4 gallons of milk in the 8-gallon jug. In either case, there are no other measuring devices available to us. ANS:-           I will answer the second problem here and I will give the code which you can run yourself and improve it if you want. One solution to the second problem is 8-0-0, 3-5-0, 3-2-3, 6-2-0, 6-0-2, 1-5-2, 1-4-3, 4-4-0. let us consider X-Y-Z as 8-5-3 jugs The code is :- #include<iostream> using namespace std; int main() { int limX = 8, limY = 5, limZ = 3; int x = 8, y = 0, z = 0; in...

DATE :- 10/02/2020 When heuristics are added, we will be in a position to compare alternatives based on heuristic values and choose one path over another to make a proper decision. If the heuristic is really good, the path chosen is usually better than others and we can reach to a solution much faster. Heuristic function We begin with a notion of a heuristic function. This function takes the problem state as the input and generates a value between some extremes. Usually, it is between -10 to 10. The value -10 indicates that it is impossible to reach to a solution (a goal state) from this given state while the value 10 indicates that the state is a goal state. There are two questions commonly arise when such argument is presented. The first question is how to write such a function. We may, for the time being, assume that such a function is defined and available. The second question, if such a function is available, how to put it to use. some examples are gi...

DATE :- 10/02/2020  A typical chess playing program might need to evaluate a million states during a serious chess game. We will look at two types of search, guided and unguided. Unguided search is done without the help of heuristics while guided search takes the help of heuristic in choosing seemingly better path than the rest. Guided and unguided search Let us go back to the previous chapter and look at the 8-5-3 gallon milk jug problem. Suppose we have no clue about how to achieve the solution, we may start randomly and try applying any rule which is applicable to a given state space. We may have a sequence which is different than what led to the solution in the previous chapter but if given enough amount of tries it is quite likely to reach to a solution barring an important point; the solution path should not contain any cycles. For example consider following sequences 8-0-0, 3-5-0, 8-0-0, ... 8-0-0, 5-0-3, 0-5-3, 3-5-0, 8-0-0, .. 8-0-0, 5-0-3, 5-3-0, 2-3-3,...

DATE :- 09/02/2020 Both problems we have seen in the previous module were comparatively simple as there was the little prerequisite for applying rules. To emphasize that important part, let us take two more problems which rely heavily on the prerequisites for applying a rule. A missionary cannibal problem Let us take our next example to reiterate our understanding of state space, the start state, the end state, the rules and using those rules to solve the problem, especially the preconditions under which a rule is to be applied.  The problem is called a missionary and cannibal problem. Three missionaries and three cannibals found themselves on one side of a river. All of them have to move to the other side. The only boat available for communication can carry maximum two of them at a time. Minimum one of the travelers must come back to get the boat on the side where others are waiting. Another condition is, at no point in time, the missionaries should be less than the nu...

Date : 08/02/2020 Many AI problems are hard to solve because they are difficult to be characterized. Not only the problem but a path to the solution is also hard to be characterized. While considering chess game , If we go and write every chess move, we may not be able to complete it in our lifetime. Solving AI Problems The first problem is called 3-4 gallon water jug problem as described in the book by Elaine Rich. We begin with two empty jugs of the capacity of 3 and 4 gallons respectively. We have an infinite supply of water available and we want the 4-gallon jug to be filled with exactly 2 gallons of water. Another problem is called 8-5-3 milk jug problem which begins with 8-gallon milk jug completely full while other two are empty. We want exactly 4 gallons of milk in the 8-gallon jug. In either case, there are no other measuring devices available to us. One solution for the first problem is 0-0, 0-4, 3-1, 0-1, 1-0, 1-4, 3-2. (Where n-m indicates quantity of wate...

date : 08/02/2020 I created my first blog today. I completed 1st module of artificial intelligence and started module 2. In module 1 introduction to AI is given. AI has many definitions associated with it. The AI  is a way of solving difficult problems. Difficult problems which are done by humans, like brushing teeth, brushing is very complicated process to be done by robot. If power is low or high it can not do work . It is the first time I think how chess game in android works. there are infinite numbers of moves to play. But with help of AI it is actually working . Old chess games at high difficulty level were taking so much time to play one move but now it takes only few seconds.           Humans are able to guess and work. but a program can not do that easily. Programs works  stepwise.