A*算法的简单运用

1、 Problem Description
This is a problem that is prominently featured in the lm Die Hard With a Vengeance. You have a
3-gallon and a 5-gallon jug that you can ll from a fountain of water. The problem is to ll one of
the jugs with exactly 4 gallons of water. How do you do it?
This is the solution (not the only solution):
1. Fill up the 3-gallon jug
2. Transfer to the 5-gallon jug
3. Fill up the 3-gallon jug again
4. Transfer water to ll up the 5-gallon jug, leaving 1 gallon in the 3-gallon jug
5. Empty out the 5-gallon jug
6. Transfer the 1 gallon to the 5-gallon jug
7. Fill up the 3-gallon jug and transfer that to the 5-gallon jug
8. The 5-gallon jug contains 4 gallons of water
The sequence here is:
(0; 3)
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值