4 ms·
It appears that a 1981 version of the source code is both available and runnable: https://github.com/seveno4/EURISKO https://github.com/seveno4/EURISKO
by 12_throw_away 2y ago
It appears that a 1981 version of the source code is both available and runnable: https://github.com/seveno4/EURISKO https://github.com/seveno4/EURISKO
- wiz21c 2y agoAt that time rules systems (expert systems) were very popular
- graemep 2y agoI wrote one as part of my first paid job (holiday job between school and university) in the late 80s. My prototype was eventually turned into a production system that was used for many years.
- deleted 2y ago[deleted]
- JasserInicide 2y agoThe inline comments of when a function was last edited as very rough version control is quite something
- versteegen 2y ago(The source for both AM and Eurisko were discovered at the same time.) I was reading through the source code for both (and the Interlisp manual, but mostly Eurisko) earlier this year and found it quite inspiring. Some of the most meta(-meta-heuristic search) code ever written! Now I'm working on a similar project and am looking for parts of AM's and Eurisko's algorithms which I can incorporate! I'll write something up if I have any success. Eurisko is far more abstract than AM, but the data structures (structures with named 'slots' (members)) it uses makes the code vastly more readable (AM is pretty damn unreadable despite plenty of comments). Lenat himself said the better representations are what made Eurisko possible, unsurprisingly. If you do want to understand the implementation of AM in incredible detail you can read Lenat's PhD thesis. No detailed documentation of Eurisko exists. Also, both programs contain lots of code to print out what the system is currently doing, which is incredibly helpful for deciphering the code.