{"title":"搜索方法","authors":"Theodore Louis, Behan Kelly","doi":"10.1201/9781351037389-5","DOIUrl":null,"url":null,"abstract":"• Nets and Basic Search o Blind Methods Depth-first Search Breadth-first Search Non-deterministic Search o Heuristically Informed Methods Hill Climbing Beam Search • Nets and Optimal Search o The Best Path The British Museum Procedure Branch-and-Bound Search o Redundant Paths Discrete Dynamic Programming A* Procedure • Trees and Adversarial Search o Algorithmic Methods Minimax Procedure Alpha-Beta Pruning o Heuristic Method Progressive Deepening","PeriodicalId":280198,"journal":{"name":"Introduction to Optimization for Environmental and Chemical Engineers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Search Methods\",\"authors\":\"Theodore Louis, Behan Kelly\",\"doi\":\"10.1201/9781351037389-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"• Nets and Basic Search o Blind Methods Depth-first Search Breadth-first Search Non-deterministic Search o Heuristically Informed Methods Hill Climbing Beam Search • Nets and Optimal Search o The Best Path The British Museum Procedure Branch-and-Bound Search o Redundant Paths Discrete Dynamic Programming A* Procedure • Trees and Adversarial Search o Algorithmic Methods Minimax Procedure Alpha-Beta Pruning o Heuristic Method Progressive Deepening\",\"PeriodicalId\":280198,\"journal\":{\"name\":\"Introduction to Optimization for Environmental and Chemical Engineers\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Introduction to Optimization for Environmental and Chemical Engineers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9781351037389-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Introduction to Optimization for Environmental and Chemical Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9781351037389-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
• Nets and Basic Search o Blind Methods Depth-first Search Breadth-first Search Non-deterministic Search o Heuristically Informed Methods Hill Climbing Beam Search • Nets and Optimal Search o The Best Path The British Museum Procedure Branch-and-Bound Search o Redundant Paths Discrete Dynamic Programming A* Procedure • Trees and Adversarial Search o Algorithmic Methods Minimax Procedure Alpha-Beta Pruning o Heuristic Method Progressive Deepening