Pdf solving the general two water jugs problem via an. Artificial intelligence 15cs562 ravi kumar b n assistant professor dept. You are given two jugs, a 4gallon one and a 3gallon one, a pump which has unlimited water which you can use to ll the jug, and the ground on which water may be poured. The problem is solvable only when t is a multiple of gcda, b and can be modeled as search. Pdf a heuristic method for solving the generalized water jugs. Automation techniques in irrigation and enabling farmers importance of drone as per a recent pwc study, the total addressable market for. Another way to describe the chess moves white pawn at squarefile e, rank 2.
Water pouring puzzles are a class of puzzle involving a finite collection of water jugs of known integer capacities in terms of a liquid measure such as liters or gallons. Water jug problem part1 in details state space production rules artificial intelligence duration. So, to solve this problem, following set of rules were proposed. Given two unmarked jugs having capacities a and b liters respectively and a target volume t liters, find the moves that get exactly t liters in any of the two jugs. Initially each jug contains a known integer volume of liquid, not necessarily. Water jug problem in artificial intelligence youtube. Write a program to implement dfs for 8 puzzle problem or water jug problem or any ai. From the beginning, one of the major research directions in artificial intelligence was automated. Pdf the water jugs problem is a famous problem in artificial intelligence, computer.
Write a program to implement bfs for 8 puzzle problem or water jug problem or any ai search problem. There is a pump that can be used to fill the jugs with water. You are given two jugs, a 4gallon one and a 3gallon one. How can you get exactly 2 gallons of water into the 4gallon jug. Write a program to solve 8 puzzle problem using prolog. Growth surge puts pressure on housingour view there are people who love the colors of fall, the crisp air of morning. Artificial intelligence water jug problem watch more videos at lecture by. Level of each node in a tree from source node using bfs construct binary palindrome by repeated appending and trimming. The water jug problem the state space for this problem can be.
214 235 94 815 79 964 890 748 1220 825 214 133 1007 327 884 1423 1225 1441 958 706 647 15 1242 567 1106 1211 504 1032