  We consider a simple symmetric random walk on a spider, that is a collection
of half lines (we call them legs) joined at the origin. Our main question is
the following: if the walker makes $n$ steps how high can he go up on all legs.
This problem is discussed in two different situations; when the number of legs
are increasing, as $n$ goes to infinity and when it is fixed.
