《Programming Abstractions in C》学习第71天，p258-p282总结，总计25页。
一、技术总结
完成第chapter 6的学习。本章主要讲解回溯算法，并通过“maze(迷宫)”和“minimax strategy(极小化极大策略)”两个实际的例子来讲解。回溯算法简单来说就是从某个节点开始，沿着一条路往下走，如果该条路走不通，那么返回选择其它路。在求解的过程中也涉及到递归算法。
回溯算法的经典应用有：八皇后问题，背包问题，迷宫问题， 组合排列问题。我们需要通过实际的练习才能更好的理解该算法的思想。
二、英语总结
1.perspective是什么意思？
答：p259, The negative sign is included because the perspective has shifted: the positions were evaluated from the point of view of your opponent, whereas the ratings express the value of a move from your own point of view.
*per-(throgh) + *spek-(to observe)。c. a particular way of thinking sth，(思考问题的)角度。
2.exploit是什么意思？
答：ex-(out) + *plek-(to plait), vt. to use sth in a way that helps you。
p272, By exploiting the power of recursion, however, you can avoid coding the details of the backtracking process explicitly and develop general solution strategies that apply to a wide variety of problem domains。
三、其它
四、参考资料
1. 编程
(1)Eric S.Roberts，《Programming Abstractions in C》：https://book.douban.com/subject/2003414
2. 英语
(1)Etymology Dictionary：https://www.etymonline.com
(2) Cambridage Dictionary：https://dictionary.cambridge.org
欢迎搜索及关注：编程人(a_codists)
