What’s the difference between uniform-cost search and Dijkstra’s algorithm?
I was wondering what’s the difference between uniform-cost search and Dijkstra’s algorithm. They seem to be the same algorithm.
artificial-intelligence
TicTacToe AI Java
So I thought i’d come back after finding the old code I did for this and answer how I did it. It’s probably still far from perfect but it’s very close. I started with a very simple class of player which would get and set markers. I then added a set class which would set … Read more
What is the difference between graph search and tree search?
Judging from the existing answers, there seems to be a lot of confusion about this concept. The Problem Is Always a Graph The distinction between tree search and graph search is not rooted in the fact whether the problem graph is a tree or a general graph. It is always assumed you’re dealing with a … Read more
What is the difference between Q-learning and SARSA?
Yes, this is the only difference. On-policy SARSA learns action values relative to the policy it follows, while off-policy Q-Learning does it relative to the greedy policy. Under some common conditions, they both converge to the real value function, but at different rates. Q-Learning tends to converge a little slower, but has the capabilitiy to … Read more
Python Rule Based Engine
Rather than re-inventing the wheel, I’d suggest you to use some readily available solution. There are several expert systems out there and I’ll focus on those which are either in Python or can be used via Python. CLIPS CLIPS is an expert system originally developed by NASA. It’s considered state of the art and used in … Read more
Consistent and Admissible Heuristics
As Russel and Norvig point out in Artificial Intelligence: A Modern Approach (the most commonly used AI textbook) it is challenging to come up with a heuristic that is admissible but not consistent. Obviously, you can select values for nodes in a graph such that the heuristic they represent is admissible but not consistent. This … Read more