home *** CD-ROM | disk | FTP | other *** search
- <?xml version="1.0"?>
- <!--
- Copyright 1999-2004 The Apache Software Foundation
-
- Licensed under the Apache License, Version 2.0 (the "License");
- you may not use this file except in compliance with the License.
- You may obtain a copy of the License at
-
- http://www.apache.org/licenses/LICENSE-2.0
-
- Unless required by applicable law or agreed to in writing, software
- distributed under the License is distributed on an "AS IS" BASIS,
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- See the License for the specific language governing permissions and
- limitations under the License.
- -->
- <page xmlns:jx="http://apache.org/cocoon/templates/jx/1.0">
-
- <title>Tower of Hanoi Puzzle</title>
-
- <content>
-
- <para>For some background on the puzzle, see:
- <a href="http://www.cut-the-knot.org/recurrence/hanoi.shtml">http://www.cut-the-knot.org/recurrence/hanoi.shtml</a>
- </para>
-
- <para>You've currently used ${moves} moves.</para>
-
-
- <para>The current state of the stacks is:</para>
-
- <hn:hanoi height="${puzzleSize}" xmlns:hn="http://apache.org/cocoon/apples/samples/hanoi">
- <hn:float size="${floatingDisk}"/>
- <hn:stacks>
- <jx:forEach var="stack" items="${stacks}">
- <hn:stack>
- <jx:forEach var="disc" items="${stack}">
- <hn:disc size="${disc}" />
- </jx:forEach>
- </hn:stack>
- </jx:forEach>
- </hn:stacks>
- </hn:hanoi>
-
- </content>
-
- </page>
-