19 – Sliding Blocks Puzzle 2

Now, we’re trying to build an artificial intelligence that can solve problems like this all on it’s own. You can see that the search algorithms do a great job of finding solutions to problems like this. But you might complain that in order for the search algorithms to work, we had to provide it with … Read more

18 – Sliding Blocks Puzzle 1

h1 is admissible because every tile that’s in the wrong position must be moved at least once to get into the right position. So, h1 never overestimates. How about h2? h2 is also admissible because every tile in the wrong position can be moved closer to the correct position, no faster than one space per … Read more

16 – State Spaces 3

The answer is that the number of states is the crossproduct of the numbers of all the variables, since they’re each independent and any combination can occur. So for the power, we have three possible positions. The camera has two, the Brush Height has five. The dirt has two for each of the ten positions. … Read more

13 – State Spaces

So far, we’ve looked at the state space of cities in Romania, a two-dimensional physical space. But the technology for problem-solving through search can deal with many types of state spaces. Dealing with abstract properties, not just x-y position in a plane. Here I introduce another state space, the vacuum world. It’s a very simple … Read more

1 – More Uniform Cost

Let’s try to understand a little better how uniform cost search works. We started on start state, and then we start expanding out from there looking at different paths. And what we end up doing is expanding in terms of contours like on a topological map. Where first we expand out to a certain distance, … Read more