{"type":"ScholarlyArticle","title":"A Quantitative Analysis of Minimal Window Search","authors":[{"name":"Alexander Reinefeld","slug":"alexander-reinefeld","given":"Alexander","family":"Reinefeld","affiliation":"FB Informatik , Universitat Hamburg Bodenstedtstr. 16 , D-2000 Hamburg 50"},{"name":"T. Anthony Marsland","slug":"t-anthony-marsland","given":"T. Anthony","family":"Marsland","affiliation":""}],"abstract":"Use of minimal windows enhances the afJ algorithm in practical applications 811 well 811 in the search of artificially constructed game trees. Nevertheless, there exists no theoreticai model to me811ure the strengths and weaknesses of minimal window search. In particular, it is not known which tree ordering properties are favorable for minimal window search. This paper presents a quantitative analysis of minimal window search based on recursive equations which 8ll8eB8 the influence of static node values on the dynamic search process. The analytical model is computationally simple, e811ily extendible and gives a realistic estimate of the expected search time for averagely ordered game trees.","doi":null,"url":"https://ijcai.org/proceedings/1987/196","pdf":"https://ijcai.org/proceedings/1987/0196.pdf","markdown":"https://ijcai.org/proceedings/1987/196.md","bibtex":"https://ijcai.org/proceedings/1987/bibtex/196","volume":{"slug":"1987","title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1987","url":"https://ijcai.org/proceedings/1987/","year":1987,"location":"Milan, Italy","dates":"","editors":"John McDermott","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Reasoning","track":"Reasoning","number":196,"pages":{"first":951,"last":953},"keywords":[],"videos":[],"references":[{"position":1,"raw":"M.S. Campbell, T.A. Marsland. A compariaon of minima% tree 8earch algorithm8. Artificial Intelligence 20,4(1983) , 347-367.","title":"A compariaon of minima% tree 8earch algorithm8","authors":"M S Campbell, T A Marsland","year":"1983","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"J.P. Fishburn. Analysis of Speedup in Distributed Algo- rithms. UMI Research Press, Ann Arbor (1984) (see also Univ. Wisconsin, Ph.D. thesis, 1981).","title":"Analysis of Speedup in Distributed Algorithms","authors":"J P Fishburn","year":"1981","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"D.E. Knuth, W. Moore. An analyBis of alpha-beta pruning. Artificial Intelligence 6,4{1975), 293-326.","title":"An analyBis of alpha-beta pruning","authors":"D E Knuth, W Moore","year":"1975","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"T .A. Marsland, F. Popowich. Parallel game-tree search. IEEE PAMI-7,4(1985), 442-452. .","title":"Parallel game-tree search","authors":"T A Marsland, F Popowich","year":"1985","venue":"IEEE PAMI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"A. Muszycka, R. Shinghal. An empirical comparison of pruning strategies in game trees. IEEE SMC 15,3{1985), 389-399.","title":"An empirical comparison of pruning strategies in game trees","authors":"A Muszycka, R Shinghal","year":"1985","venue":"IEEE SMC","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"J. Pearl. ABymptotic propertieB of minima% trees and game- 8earching procedureB. Artificial Intelligence 14(1980), 113- 138.","title":"ABymptotic propertieB of minima% trees and game-8earching procedureB","authors":"J Pearl","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"A. Reinefeld. An improvement of the Scout tree search al- gorithm. ICCA Journal 6,4(1983), 4-14 .","title":"An improvement of the Scout tree search algorithm","authors":"A Reinefeld","year":"1983","venue":"ICCA Journal","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}