karim-53 / artificialintelligence-puzzle-using-nondeterministic-search Goto Github PK

This project forked from dorraelmekki/artificialintelligence-puzzle-using-nondeterministic-search

Solution to this problem using Nondeterministic Search: You have two jugs. One holds 10 liters of water when completely full, the other holds 6 liters when completely full. You have an unlimited source of water to fill either or both jugs, and you may do so as often as you like, but there are no markings on the jugs, so if you fill a jug the only way to know how much water you’ve put in is if you fill it to the top. In addition, you have amazing accuracy in pouring water from one jug to another and never lose a drop. When you do choose to pour water from one jug to another you must keep pouring until either the receiving jug is full or the source jug is emptied of water. You can also always choose to fully empty either jug. Can you get 8 liters of water in the larger jug?