{"resolved":true,"match_type":"uuid","source_type":"original_book","book_id":"dde4e586-1def-4457-8ec5-0287b0b0511d","title":"认知 人行为背后的思维与智能","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787300273921","requested_by":"printed_page","book":{"source_type":"original_book","book_id":"dde4e586-1def-4457-8ec5-0287b0b0511d","id":"dde4e586-1def-4457-8ec5-0287b0b0511d","uuid":"dde4e586-1def-4457-8ec5-0287b0b0511d","title":"认知 人行为背后的思维与智能","normalized_title":"认知人行为背后的思维与智能","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787300273921","isbns":["9787300273921"],"parsed":true,"ai_readable":true,"document_type":"book","page_count":290,"navigation_url":"https://workshop.closeclaw.top/ai/book/dde4e586-1def-4457-8ec5-0287b0b0511d","title_url":"https://workshop.closeclaw.top/ai/title/%E8%AE%A4%E7%9F%A5%20%E4%BA%BA%E8%A1%8C%E4%B8%BA%E8%83%8C%E5%90%8E%E7%9A%84%E6%80%9D%E7%BB%B4%E4%B8%8E%E6%99%BA%E8%83%BD","fixed_page_url_template":"https://workshop.closeclaw.top/ai/book/dde4e586-1def-4457-8ec5-0287b0b0511d/page/{printed_page}","path_api_url_template":"https://workshop.closeclaw.top/api/ai/book/dde4e586-1def-4457-8ec5-0287b0b0511d/page/{printed_page}","read_url":"https://workshop.closeclaw.top/api/ai/read/dde4e586-1def-4457-8ec5-0287b0b0511d","page_url":"https://workshop.closeclaw.top/api/ai/books/dde4e586-1def-4457-8ec5-0287b0b0511d/page","search_url":"https://workshop.closeclaw.top/api/ai/books/dde4e586-1def-4457-8ec5-0287b0b0511d/search"},"page":{"printed_page":82,"pdf_page":93,"physical_index":93,"physical_index_base":0,"printed_page_status":"recognized","page_sha256":"a769afae42e9162bf916058aeadbbcf2b2e70baf56d9811b39beb81243a1f4c3"},"chapter":"第三章问题解决","content":"从上题来说，我们只减少了一步，似乎意义不大。但是对一个从开始到目标有很多步子的长距离的复杂问题，如果我们能忽略细节，在计划空间中少取几个点l，使l《l，那就可以节省很多时间了。当然，在用简化法得出结果之后，我们还需把原先忽略掉的细节补进去。当回过头来解决这次一级的小步子时，问题可能是很简单的，我们已有实验证明了这一点。总之，只要被试是聪明的，他就能用上述方法把大问题变为小问题，而这时的小问题又比较容易得到解决了。\n\n为什么有些问题容易，有些问题困难，即问题难度的基础是什么呢？问题的搜索空间大，可能就困难。国际象棋的棋盘只有64个格，这个搜索空间包括10120种可能性。但是，这样的问题并不太难解决。不能仅从表面上搜索空间的大小来判断问题的难度。有些问题看上去不大，可是很难解决，例如五个圆盘的河内塔，搜索空间只有243种可能性，但要实现这243种可能性，大约有1016条路线。所以解决这个问题并不容易。\n\n认知\n\n82","previous_page":81,"next_page":83}