该博客探讨了如何通过迭代加深搜索（IDDFS）来找到计算x^n所需的最少乘法和除法操作数。博客作者首先介绍了问题背景，即如何通过幂运算和乘法来有效地计算x^n，并给出了几个示例。接着，博主分享了初次尝试解决问题的挫折，以及在请教他人后得到的启发。最后，详细解释了利用剪枝策略优化搜索过程的两个关键点，并提供了相应的代码实现。
Description
Starting with x and repeatedly multiplying by x, we can compute x31 with thirty multiplications:
x2 = x × x, x3 = x2 × x, x4 = x3 × x, …, x31 = x30 × x.
The operation of squaring can be appreciably shorten the sequence of multiplications. The following is a way to compute x31 with eight multiplications:
x2 = x × x, x3 = x2 × x, x6 = x3 × x3, x7 = x6 × x, x14 = x7 × x7, x15 = x14 × x, x30 = x15 × x15, x31 = x30 × x.
This is not the shortest sequence of multiplications to compute x31. There are many ways with only seven multiplications. The following is one of them
最低0.47元/天 解锁文章
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
