"Chess Playing Programs and the Problem of Complexity", Allen Newell, J. C. Shaw, Herbert Simon, IBM Journal of Research and Development 2, Oct. 1958, 320--335, also in [Feigenbaum and Feldman 63].  Home/Search   Document Not in Database   Summary   Related Articles

....one does not expect instantaneous responses from humans doing the same tasks. They are not tasks that are situated in the world. One can debate whether even in these tasks it is wise to rely so heavily on search, as bigger problems will have exponentially bad effects on search time in fact [Newell, Shaw and Simon 58] argue just this, but produced a markedly slower chess program because of the complexity of static evaluation and search control. Some, such as [Samuel 59] with his checker s playing program, did worry about keeping things on a human timescale. Slagle 63] in his symbolic integration program, was ....

"Chess Playing Programs and the Problem of Complexity", Allen Newell, J. C. Shaw, Herbert Simon, IBM Journal of Research and Development 2, Oct. 1958, 320--335, also in [Feigenbaum and Feldman 63].

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC