{"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":99,"pdf_page":110,"physical_index":110,"physical_index_base":0,"printed_page_status":"recognized","page_sha256":"7e8914aa9c8746e062a2c9a212b7f85edb838a61089bba2f5dd7fcdc30cf520f"},"chapter":"第三章问题解决","content":"目标递归策略仅需如下四个产生式就能解决问题。\n\n$$\n\\mathrm { G O A L . R E C U R S I O N }\n$$\n\n$$\n\\mathrm { P } _ { \\mathrm { i } } \\mathrm { G } = \\mathrm { M } ( k , \\mathrm { C } ) {  } \\mathrm { M } ( k , \\mathrm { C } ) , \\mathrm { R E M O V E } ( \\mathrm { G } )\n$$\n\n$$\n\\mathrm { P _ { 2 } G } \\mathrm { = M P Y R ( 1 , C ) } \\mathrm {  } \\mathrm { M ( 1 , C ) } , \\mathrm { R E M O V E ( G ) }\n$$\n\n$$\n\\mathrm { P } _ { 3 } \\mathrm { G } { = } \\mathrm { M P Y R } ( k . \\mathrm { C } )\n$$\n\n$$\n\\ J { \\bf { \\Psi } } { \\bf { \\Psi } } { \\bf { > } } \\mathrm { R E M O V E } ( \\mathrm { G } )\n$$\n\n$$\n\\mathrm { S T O R E } [ \\mathrm { G } = \\mathrm { M P Y R } ( k - 1 . \\mathrm { O } ) ]\n$$\n\n$$\n\\mathrm { S T O R E } [ \\mathrm { G } = \\mathrm { M } ( k . \\mathrm { C } ) ]\n$$\n\n$$\n\\mathrm { S T O R E } [ \\mathrm { G } = \\mathrm { M P Y R } ( k - 1 . \\mathrm { C } ) ]\n$$\n\n$$\n\\mathrm { P _ { 4 } {  } S T O R E [ G = M P Y R ( N . G O A L P E G ) ] }\n$$\n\n产生式是存在短时记忆中的信息，即要达到的目标与分目标。产生式右侧是相应的动作。程序中的第一个产生式是：如果在短时记忆中的目标是移动第k本书到位置C，那么相应的动作就是将第k本书移到C，并从记忆中去掉这个目标。第二个产生式是：如果目标是将仅由第一本书构成的金字塔移到C那么就把第一本书移到C，并从记忆中去掉这个目标。第三个产生式是整个方法的核心，如果在短时记忆中的目标是把由k本书（k可以是5、4、3、2）构成的金字塔移到位置C，相应的动作是从记忆中去掉这个目标，而存入三个新的目标：\n\n(1)将由k—1本书构成的金字塔从原来的位置移到除C以\n\n第三章 问题解决\n\n99","previous_page":98,"next_page":100}