Hello world!
Welcome to WordPress. This is your first post. Edit or delete it, then start writing!
Search Algorithms in AI
Artificial Intelligence is the study of building agents that act rationally. Most of the time, these agents perform some kind of search algorithm in the background in order to achieve their…
intelligent agent
An intelligent agent is a program that can make decisions or perform a service based on its environment, user input and experiences. These programs can be used to autonomously gather…
What is AI?
A machine with the ability to perform cognitive functions such as perceiving, learning, reasoning and solve problems are deemed to hold an artificial intelligence. Artificial intelligence exists when a machine…
Mirror mirror on the wall, which is the shortest path of them all?
In order to determine which of these six possible paths is the shortest one — and thus the ideal choice for our salesman — we need to build up the cost of every single…
Hello world!
Welcome to WordPress. This is your first post. Edit or delete it, then start writing!
Brute-force to begin with
The traveling salesman in our example problem has it pretty lucky — he only has to travel between four cities. For simplicity’s sake, we’ll call these four cities w, x, y, and z. Because we know…
The Trials And Tribulations Of The Traveling Salesman
Aswe dive deeper and deeper into the world of computer science, one thing starts to become very clear, very quickly: some problems seem to show up again and again, in…
Dynamic programming to the salesman’s rescue
Now that we’ve identified our overlapping and recurring subproblems, there’s only one thing left to do: eliminate the repetition, of course! Flipping TSP on its head, part 4. Using our function…
Turning TSP on its head
If we look at our top down methodology from last week, we’ll see that we have enumerated through all of the permutations of paths — that is to say, we have brute-forced our…


