If you're lucky, the data is in the right place and it doesn't take that long.

We have a 3 dimensional state space.

If we now do the math, we can now see it cost me 100 to acquire one paying customer.

Here is a second question I'd like to ask you.

There is 25 chance of running into the wall, which costs me 100 plus, of course, 1 for the robot motion, and there's a 25 chance I find myself down here, which costs us 44.

There is no probablistic or stochastic outcome of actions.

And the total cost of this is 0 because each counterclockwise turn is worth 0, therefore, we just go straight to the goal, and we only pay the straight motion cost, which is 7 in total because it's 7 for the straight penalty plus 100 is 93.

In this example here, let's now say that forward motion will cost you 1.

These actions come with different costs.

And we have to turn once in this spot right over here, which costs an additional 5, so we pay a total of 12.

If you just shaded that in, that would be 100 .

Say the value of the goal state is defined to be zero.

We get 98 over here, which is minus 4 plus 102.

If I put this into mathematics, we get 50 chance for reaching the goal, 25 for hitting a wall, which costs me 100, 25 for going south, and the value here is 44.77 plus the cost of motion is 1.

Consider state C4, which one is the optimal action provided that you can run around as long as you want.

MDPs are gentle enough to have a cost factor, and the way we're going to denote costs is by defining our award function over any possible state.

So what's the least common multiple of 100, 3, 2, and 100?

So, in this year, our base index is 0.6 times a hundred, plus 0.4 times a hundred, and this will just come out to a hundred, this is 60 plus 40, this is equal to 100, as it should.

And in fact, the global average is about what it is for Ghana.

And you can see that this is the whole square.

So, that's the cost function we're going to use to fill on your own network.

They're high speed, take about 30 seconds at most.

On the right side we get zero again.

Both 10 and 100 is the least common multiple.

That is 100.

Which is the same thing as 40 plus 100.

The cost comes in two different flavors.

Now we add up all the hundreds.

80 is 100 of 80.

Ninety plus ten is one hundred.

Now, for most of the problems we'll deal with, we'll make the Path Cost function be additive so that the cost of the path is just the sum of the costs of the individual steps.

And the expenses associated with that service that you provided in month 1 is 100.

But the other reason for that is the way we implemented the hash table in Unit 5 was each bucket was a list.

Where would I plot that?

Because it's cheaper, because they don't pay the real environmental costs.

So I'll do a line here. I'll subtract that from that.

Three times thirty is ninety.

Where would I plot that on my graph?

live in those places where the costs are lowest.

100 is 125 of 80.

We've solved the problem.

It is a 125 of 80.

So then we're going to have 10 billion shares here.

In the first case we plug in X equals 10.

And fifty two plus ninety nine