Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 018 (Water bucket problem) — Constraint detection

Given the promise of SAT and CSP techniques for solving `` classical '' planning problems , I decided to propose this puzzle . You are given an 8 pint bucket of water , and two empty buckets which can contain 5 and 3 pints respectively . You are required to divide the water into two by pouring water between buckets -LRB- that is , to end up with 4 pints in the 8 pint bucket , and 4 pints in the 5 pint bucket -RRB- . What is the minimum number of transfers of water between buckets ? The challenge is to solve this as a planning problem -LRB- encoded into satisfiability or constraint satisfaction -RRB- with an efficiency approaching -LRB- or exceeding -RRB- a simple .

Problem 018 (Water bucket problem) — Detection of the decisions and objects to be modeled

Given the promise of SAT and CSP techniques for solving `` classical '' planning problems , I decided to propose this puzzle . You are given an 8 pint bucket of water , and two empty buckets which can contain 5 and 3 pints respectively . You are required to divide the water into two by pouring water between buckets -LRB- that is , to end up with 4 pints in the 8 pint bucket , and 4 pints in the 5 pint bucket -RRB- . What is the minimum number of transfers of water between buckets ? The challenge is to solve this as a planning problem -LRB- encoded into satisfiability or constraint satisfaction -RRB- with an efficiency approaching -LRB- or exceeding -RRB- a simple .

Back to list