0%

Chapter 1 · Section 3 of 3

Questions and answers

2 min read3 of 22 in Clearing the Table
On this page

This page answers short questions about what changed in the problem. Each answer is a few lines long, and each one links to the section that explains it in full. Questions about the problem that did not change are on the pushing book's questions page.

Contents#

  1. Why does "clearing the table" not mean emptying it?
  2. Why were both helps taken away at once?
  3. Why are the tables smaller than in the pushing book?
  4. Why does one budget cover the whole queue of tables?
  5. Why is a table the arm never moved on left out of the count?

1. Why does "clearing the table" not mean emptying it?#

No glass is lifted or racked in this problem. The run ends with every glass still on the table. What is cleared is the crowding. The examiner then works out whether each glass has room for the hand. Nothing is racked explains the test.

2. Why were both helps taken away at once?#

A close view is useful only if the solution can still change its mind after it. With one path chosen from the ready pose, the view comes too late. An open loop lets the view arrive in time. Why the two changes go together explains this.

3. Why are the tables smaller than in the pushing book?#

The first draw held four to seven glasses. Even perfect play separated 0 of 20 of those tables, because there was nowhere left to put a glass. A test nobody can pass ranks nothing. So each table now holds three to five glasses. The tables are smaller gives the details.

4. Why does one budget cover the whole queue of tables?#

A shared budget makes speed part of the score. A slow solution reaches fewer tables in the same 15 arm minutes. The queue is longer than any solution can finish, so the clock always runs out first. One budget for a queue of tables explains the numbers.

5. Why is a table the arm never moved on left out of the count?#

Near the end of the queue, a path may not fit in the time left. The arm then does not move. Counting that table would pull the share down for no fault of the method. So "tables attempted" is not how far down the list a solution got. What "tables attempted" counts gives an example.

← The examiner: marking the table, not the pushes · Looking, remembering and stopping →