Changes

Jump to: navigation, search

Brute-Force

131 bytes added, 14:03, 24 November 2018
no edit summary
==1980 ...==
* [[Hans Berliner]] ('''1981'''). ''An Examination of Brute Force Intelligence.'' [[Conferences#IJCAI1981|IJCAI 81]]
* [[Richard Korf]] ('''1984'''). ''The Complexity of Brute Force Search''. Technical Report, Department of Computer Science, [[Columbia University]] <ref>Paper is mentioned by [[Richard Korf#JudeaPearl|Richard Korf]] at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010</ref> <ref>Quoted by [[Hans Berliner]], [[Gordon Goetsch]] ('''1985'''). ''A Study of Search Methods : The Effect of Constraint Satisfaction and Adventurousness'', [http://dli.iiit.ac.in/ijcai/IJCAI-85-VOL2/PDF/083.pdf pdf], [http://dli.iiit.ac.in/ijcai/IJCAI-85-VOL2/PDF/083.pdf pdf]</ref>
* [[David Slate]] ('''1984'''). ''Interior-node Score Bounds in a Brute-force Chess Program.'' [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]
* [[David Levy]] ('''1986'''). ''When will Brute Force Programs beat Kasparov?'' [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]]

Navigation menu