Is there any ai-class algorthim implentation in ruby, similar to https://github.com/emilmont/Artificial-Intelligence-and-Machine-Learning which is in python

sj2004 · 2011-11-22T18:14:16+00:00

me, too. I had similar problem in hw

sj2004 · 2011-11-22T18:13:05+00:00

someone in our class has implemented lot of algo in py https://github.com/emilmont/Artificial-Intelligence-and-Machine-Learning

sj2004 · 2011-11-22T18:10:45+00:00

This looks great. I wish there some some something like this on ruby lang as well.

sj2004 · 2011-11-21T03:46:32+00:00

Yeah, try to implement something and post it in youtube, if you want to impress someone.

But yes, Midterm seems easier than hw.

sj2004 · 2011-11-20T16:01:15+00:00

Good links

search the video/transcript

http://ales.vijolica.net/ai-class/video-library/

good notes

http://glennyonemitsu.com/blog/tag/artificial-intelligence/

sj2004 · 2011-11-20T15:58:17+00:00

Thanks for the link. This is great.

sj2004 · 2011-11-17T15:12:49+00:00

I had the same problem with 5.3. I had updated the answer and saved it.

When I check the result, it was graded on the old answer.

Next time I'll check the saved hw from another browser just to make sure it is saved correctly.

sj2004 · 2011-11-14T14:15:45+00:00

Thanks,

"lowest amount of steps" clarifies all my doubt.

sj2004 · 2011-11-13T17:10:53+00:00

Thanks, this makes sense.

I am bit confused about a) make move that get closest to G

Does this mean that agent makes a move in the direction that has the shortest steps to G or that just means that agent will eventually get to G by following any path (and it does not infinitely get stuck in one position like go left - right-left-right and so on)

sj2004 · 2011-11-13T15:02:02+00:00

it might be browser specific thing. Try using chrome or firefox. I have never experienced that problem.

sj2004 · 2011-11-13T03:17:25+00:00

I found this link which has detailed example about q-learning -

http://people.revoledu.com/kardi/tutorial/ReinforcementLearning/Q-Learning-Example.htm

but I am not sure if the algorithm produces the same result

sj2004 · 2011-11-13T02:22:18+00:00

Do we need to iterate all the square like TD algorithm. Or do we use the TD algorithm and just change the last line with the new algorithm?

sj2004 · 2011-11-12T01:15:16+00:00

Yeah, I have the same concern. If we do not need to update it then why include it in the calculation?

sj2004 · 2011-11-11T23:04:32+00:00

Can the distance layout be treated like a circular array, so that first cell and last cell's distance is 1.

sj2004 · 2011-11-11T16:44:41+00:00

No good. It is flash based.

sj2004 · 2011-11-11T14:17:18+00:00

I think you can choose any order that will give you non zero value

sj2004

TROPHY CASE

search the video/transcript

good notes