From 67e1f88f9322468a936ba19f54dc7c528acbfacb Mon Sep 17 00:00:00 2001 From: Chirag Vartak Date: Wed, 23 Mar 2016 19:27:49 +0530 Subject: [PATCH] Add link to aima-java --- intro.ipynb | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/intro.ipynb b/intro.ipynb index ce9020e95..c7492aa5c 100644 --- a/intro.ipynb +++ b/intro.ipynb @@ -10,7 +10,7 @@ " \n", "## About `aima-python` \n", " \n", - " As I suspect you might already know, the repository [aima-python](https://github.com/aimacode/aima-python) implements in Python code, the algorithms in the textbook *Artificial Intelligence: A Modern Approach*. You can find these algorithms in the various modules of this repository. Typically, each module has the code for a single chapter in the book, but some modules may have code from more than two chapters in it. Most of the algorithms given in the figures of the book have been implemented. If you are looking for a particular algorithm or have trouble finding the module for the chapter you are interested in, [this index](https://github.com/aimacode/aima-python#index-of-code) might prove to be useful. The code in this repository takes care to implement the algorithms in the figures of the book *exactly as they are*. We have tried our best to write our code as close as we could to the pseudocodes in the textbook, and haven't done any optimizations to it that may hamper with code readability. The intention of this code is to be readable, so that you can relate it to the algorithms in the textbook. For algorithms that we thought really needed optimizations, we have written these seperately as different functions and stated so in comments. \n", + " As I suspect you might already know, the repository [aima-python](https://github.com/aimacode/aima-python) implements in Python code, the algorithms in the textbook *Artificial Intelligence: A Modern Approach*. You can find these algorithms in the various modules of this repository. Typically, each module has the code for a single chapter in the book, but some modules may have code from more than two chapters in it. Most of the algorithms given in the figures of the book have been implemented. If you are looking for a particular algorithm or have trouble finding the module for the chapter you are interested in, [this index](https://github.com/aimacode/aima-python#index-of-code) might prove to be useful. The code in this repository takes care to implement the algorithms in the figures of the book *exactly as they are*. We have tried our best to write our code as close as we could to the pseudocodes in the textbook, and haven't done any optimizations to it that may hamper with code readability. The intention of this code is to be readable, so that you can relate it to the algorithms in the textbook. For algorithms that we thought really needed optimizations, we have written these seperately as different functions and stated so in comments. Also, before you proceedif you are more comfortable with Java than you are with Python we also have [aima-java](https://github.com/aimacode/aima-java) repository. \n", " \n", "## What version of Python?\n", " \n", @@ -55,7 +55,7 @@ "name": "python", "nbconvert_exporter": "python", "pygments_lexer": "ipython3", - "version": "3.5.1" + "version": "3.4.4" } }, "nbformat": 4,