After spending 10-15 minutes, I finally reached a solution. It's possible that this solution has some amount of redundancy, and thus isn't canonical.
The schema followed in this solution is this: X-Y, where X denotes the amount inside the container, the Y denotes the remaining capacity.
- 0-19, 13-0, 7-0 Starting configuration
- 13-6, 0-13, 7-0
- 13-6, 7-6, 0-7
- 6-13, 7-6, 7-0
- 6-13, 13-0, 1-6
- 19-0, 0-13, 1-6
- 19-0, 1-12, 0-7
- 12-7, 1-12, 7-0
- 12-7, 8-5, 0-7
- 5-14, 8-5, 7-0
- 5-14, 13-0, 2-5
- 18-1, 0-13, 2-5
- 18-1, 2-11, 0-7
- 11-8, 2-11, 7-0
- 11-8, 9-4, 0-7
- 4-15, 9-4, 7-0
- 4-15, 13-0, 3-4
- 17-2, 0-13, 3-4
- 17-2, 3-10, 0-7
- 10-9, 3-10, 7-0 Solved
The idea is to fill A and empty it to C then transfer the same to B and do it recurrsively.
ReplyDeletenice! i hadn't thought that!
ReplyDelete