under【信息技术】.docVIP

UNDERGROUND CITY PROBLEM You are imprisoned in one of the underground cities of Cappadocia. Wandering around in the dark you find by chance the map of the city. Unfortunately, there is no mark on the map pointing where you are. It is your task to find that out by exploring the city. The map of the city is a rectangular grid of unit squares. Each square is either an open square, marked with the letter ‘O’, or a part of a wall, marked with the letter ‘W’. The north direction is also shown on the map. Luckily, you have a compass at hand so you can orient the map correctly. Initially, you are on an open square. Everything starts by calling the procedure (or function) start with no arguments. You can explore the city by using the procedures (or functions) look and move. You can pose questions in the form of a function call look(dir) where dir denotes the direction you are looking at, which can be one of the characters ‘N’, ‘S’, ‘E’ and ‘W’ denoting north, south, east and west, respectively. Now assume the argument dir is ‘N’. The reply will be the letter ‘O’ if the square to your north is an open square, and ‘W’ if it is a wall. Similarly, it is possible to look at and get information about the other neighboring squares. You can step into one of the four neighboring squares by calling move(dir) where dir denotes the direction of your step as described above. You can only move to an open square. Attempting to move into a wall would be a grave mistake. It is possible to reach any open square of the city starting from any open square. You are required to find the position of the open square where you found the map by looking (calling look(dir)) minimum number of times. Once you found the position you must report it by calling finish(x,y) where x is the horizontal (west-east) coordinate and y is the vertical (south-north) coordinate of the position. ASSUMPTIONS 3 ? U ??100 where U is the width of the map, i.e. length, in number of squares, of the map in the horizon