For the Dim-sum Serving problem, there are THREE tables that the waiter needs to serve with dim-sum and three possible a

[answerhappygod]

For The Dim Sum Serving Problem There Are Three Tables That The Waiter Needs To Serve With Dim Sum And Three Possible A 1 (81.81 KiB) Viewed 29 times

For the Dim-sum Serving problem, there are THREE tables that the waiter needs to serve with dim-sum and three possible actions Move UP (U), Move DOWN (D) and Serve (S). A slot could be either Dim-sum_Served or Empty_Table. Serve to an Empty_Table makes it becomes Dim-sum_Served. Move UP (DOWN) in the top (bottom) slot will stay in the same slot. The objective of the Dim-sum Serving problem is to serve dim-sum in all tables. An example state that the waiter is located at the top slot (Dim-sum_Served) and the other two slots are with Empty_Tables is given: A (a) Compute the number of all possible states for this problem. (b) Without any knowledge, give the current BELIEVE STATE. (c) Draw the Belief State Space of this problem. (d) State an Action Sequence such that the waiter must be able to complete the task without any knowledge of the current state.