What should be in the blanks in the following algorithms?

How can you solve partially observable problems?

What local search algorithm is described by the following?

• The best move is not chosen instead a random one is chosen.
• If the move actually results better, it is always executed.
• Otherwise, the algorithm takes the move with a probability of less than 1.

The robot can sense (observe) its surrounding walls, whether there is a wall in the north (N), south (S), east (E), or west (W). 

After moving to the east, the robot observed that there were walls in NS. What is the position of the robot?

What search algorithm is described by the following?

The following diagram shows part of the search graph for the slippery vacuum world. What kind of problem is this? (Choose the best answer.)

Which is NOT true about on-line search in Chapter 4? 

The following diagram shows the four iterations of Learning Real Time A* (LRTA*) on a one-dimensional state space. Each state is labeled with H(s), the current cost estimate to reach a goal, and every link has an action cost of 1. The red state marks the location of the agent, and the updated cost estimates at each iteration have a double circle. What will be the agent's move in the next iteration?

Which one of the following diagrams describes the searching with no observation in nondeterministic (slippery) environments?

If an agent's percepts provide no information at all (a sensorless or conformant problem), what is the solution to the following vacuum world problem?