1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
|
<HTML>
<HEAD>
<TITLE>xpanex</TITLE>
</HEAD>
<BODY>
<H1>xpanex</H1>
<HR>
<PRE>
</PRE>
<H2>SYNOPSIS</H2><PRE>
<B>/usr/games/xpanex</B> [-geometry
[{width}][x{height}][{+-}{xoff}[{+-}{yoff}]]] [-display
[{host}]:[{vs}]] [-[no]mono] [-[no]{reverse|rv}] [-{foreground|fg}
{color}] [-{background|bg} {color}] [-tile {color}] [-pyramid{0|1}
{color}] [-delay msecs] [-[no]sound] [-moveSound {filename}]
[-{font|fn} {fontname}] [-tiles {int}] [-{mode {int}|hanoi|algo-
rithme|panex}] [-userName {string}] [-scoreFile {filename}] [-scores]
[-version]
</PRE>
<H2>DESCRIPTION</H2><PRE>
Panex - A grooved sliding tile puzzle created by Toshio Akanuma and
manufactured by the Tricks Co., Ltd of Tokyo, Japan (a Magic Company)
in the 1980's. Mathematicians at Bell Laboratories calculated the num-
ber of moves to be 27,564 to 31,537. It came in two varieties: one
with a magenta and a orange pyramid of order 10 on silver tiles; in the
gold version pieces of each color look alike (i.e. no pyramid is drawn
on them), this is a little harder. The goal in this puzzle is to sim-
ply exchange the 2 piles. Pieces with smaller trapazoids can not go
down as far as pieces with bigger trapazoids.
The original Tower of Hanoi puzzle is the invention of Edouard Lucas
and was sold as a toy in France in 1883. The legend of 64 disks in the
great temple of Benares of the god Brahma is also his invention. The
goal in this puzzle is to move the pile from the left side to the right
most column. Unlike panex, a large trapazoid can not go on top of a
smaller one, but pieces always fall to the bottom.
The original Algorithme 6 is 2 stacks of 3 wooden spheres on 2 of 3
posts. The spheres come in 3 different sizes. The goal goal is to
swap the spheres using the posts without putting a bigger sphere on a
smaller one and without exceeding the size of the post. It was created
and produced by Patrick Farvacque around 1997. The puzzle presented
here has a simpler solution because the tiles are all the same height
(i.e. a 39 move solution as opposed to 66).
</PRE>
<H2>FEATURES</H2><PRE>
Press "<B>mouse-left</B>" button to move a tile in the top tile of a column.
Release "<B>mouse-left</B>" button on another column to move the tile to that
column. It will not move if blocked.
Click "<B>mouse-right</B>" button, or press "<B>C</B>" or "<B>c</B>" keys, to clear the puz-
zle.
Press "<B>G</B>" or "<B>g</B>" keys to get a saved puzzle.
Press "<B>W</B>" or "<B>w</B>" keys to save (write) a puzzle.
Press "<B>U</B>" or "<B>u</B>" keys to undo a move.
Press "<B>R</B>" or "<B>r</B>" keys to redo a move.
Press "<B>S</B>" or "<B>s</B>" keys to auto-solve. Unfortunately, its only imple-
mented from the starting position.
Press "<B>M</B>" or "<B>m</B>" keys to switch between Hanoi (one pyramid column),
Algorithme, and Panex, (each has two pyramid columns) modes (they each
have different rules).
In Hanoi, one can not place larger trapezoid on a smaller trapezoid.
Here the goal is to move the pile from the left peg to the rightmost
peg.
Algorithme is similar, here we must exchange tiles and we are limited
by the size of the stack. A move from stack 1 to stack 3 and
vice-versa when stack 2 is full.
In Panex, a tile can not go lower that its initial starting point.
Here again, the goal is to exchange the 2 piles.
Press "<B>I</B>" or "<B>i</B>" keys to increase the number of tiles.
Press "<B>D</B>" or "<B>d</B>" keys to decrease the number of tiles.
Press "<B>></B>" or "<B>.</B>" keys to speed up the movement of tiles.
Press "<B><</B>" or "<B>,</B>" keys to slow down the movement of tiles.
Press "<B>@</B>" key to toggle the sound.
Press "<B>Esc</B>" key to hide program.
Press "<B>Q</B>", "<B>q</B>", or "<B>CTRL-C</B>" keys to kill program.
Unlike other puzzles in the collection there is no way to move pieces
without drag and drop.
The title is in the following format (non-motif version):
x{hanoi | algorithme | panex}: <Number of rows> @ (<Number of
moves>/{<Record number of moves> <user name>|"NEVER noaccess"})
- <Comment>
If there is no record of the current puzzle, it displays "NEVER noac-
cess".
</PRE>
<H2>OPTIONS</H2><PRE>
<B>-geometry</B> <B>{+|-}</B><I>X</I><B>{+|-}</B><I>Y</I>
This option sets the initial position of the panex window
(resource name "<I>geometry</I>").
<B>-display</B> <I>host</I><B>:</B><I>dpy</I>
This option specifies the X server to contact.
<B>-[no]mono</B>
This option allows you to display the panex window on a color
screen as if it were monochrome (resource name "<I>mono</I>").
<B>-[no]{reverse|rv}</B>
This option allows you to see the panex window in reverse video
(resource name "<I>reverseVideo</I>").
<B>-{foreground|fg}</B> <I>color</I>
This option specifies the foreground of the panex window
(resource name "<I>foreground</I>").
<B>-{background|bg}</B> <I>color</I>
This option specifies the background of the panex window
(resource name "<I>background</I>").
<B>-tile</B> <I>color</I>
This option specifies the tile color of the tiles in the panex
window (resource name "<I>tileColor</I>").
<B>-pyramid0</B> <I>color</I>
This option specifies the foreground of the first pyramid
(resource name "<I>pyramidColor0</I>").
<B>-pyramid1</B> <I>color</I>
This option specifies the foreground of the second pyramid, if
it exists (resource name "<I>pyramidColor1</I>").
<B>-delay</B> <I>msecs</I>
This option specifies the number of milliseconds it takes to
move a tile or a group of tiles one space (1-50) (resource name
"<I>delay</I>").
<B>-[no]sound</B>
This option specifies if a sliding tile should make a sound or
not (resource name "<I>sound</I>").
<B>-moveSound</B> <I>filename</I>
This option specifies the file for the move sound for the slid-
ing of the tiles (resource name "<I>moveSound</I>").
<B>-{font|fn}</B> <B>ontname</B>
This option specifies the font that will be used (resource name
"<I>font</I>").
<B>-tiles</B> <I>int</I>
This option specifies the number of tiles in a column (resource
name "<I>tiles</I>").
<B>-mode</B> <I>int</I>
This option specifies the hanoi (0), algorithme (1), or panex
(2) mode (resource name "<I>mode</I>").
<B>-hanoi</B> This option specifies the hanoi mode (resource name "<I>mode</I>").
<B>-algorithme</B>
This option specifies the algorithme mode (resource name
"<I>mode</I>").
<B>-panex</B> This option specifies the panex mode (resource name "<I>mode</I>").
<B>-userName</B> <I>string</I>
This option specifies the user name for any records made or
else it will get your login name (resource name "<I>userName</I>").
<B>-scoreFile</B> <I>filename</I>
Specify an alternative score file (resource name "<I>scoreFile</I>").
<B>-scores</B> This option lists all the recorded scores and then exits.
<B>-version</B>
This option tells you what version of xpanex you have.
</PRE>
<H2>RECORDS</H2><PRE>
You must clear the puzzle before a record is set, otherwise an assump-
tion of cheating is made if it is solved after a get or an auto-solve.
</PRE>
<H2>SAVE FORMAT</H2><PRE>
Here is the format for the xpanex configuration, starting position, and
the movement of its pieces.
mode: 0-2 <0 hanoi, 1 algorithme, 2 panex>
tiles: 1-10 <number of tiles in a column>
moves: 0-MAXINT <total number of moves>
startingPosition: <array pairs of column and position of each
tile>
This is then followed by the moves, starting from 1.
move #: <from_column> <to_column>
from_column is the top tile of the column
to_column is where that tile is moved to.
</PRE>
<H2>REFERENCES</H2><PRE>
Mark Manasse & Danny Sleator of AT&T Bell Laboratories and Victor K.
Wei of Bell Communications Research, Some Results on the Panex Puzzle,
Murray Hill, NJ, 1985 20 pp. (unpublished).
Vladimir Dubrovsky, Nesting Puzzles Part 1: Moving oriental Quantum
January/February 1996 pp 55-57, 50-51.
L. E. Horden, Sliding Piece Puzzles (Recreations in Mathematics
Series), Oxford University Press 1986, pp 144, 145.
Jerry Slocum & Jack Botermans, Puzzles Old & New (How to Make and Solve
Them), University of Washington Press, Seattle, 1987, p 135.
Dick Hess, Analysis of the Algorithme 6 Puzzle and its Generalisations,
Cubism For Fun, July 2008 76 pp 8-13.
</PRE>
<H2>SEE ALSO</H2><PRE>
<B>X(1)</B>, <B>xcubes(6)</B>, <B>xtriangles(6)</B>, <B>xhexagons(6)</B>, <B>xmlink(6)</B>, <B>xbarrel(6)</B>,
<B>xmball(6)</B>, <B>xpyraminx(6)</B>, <B>xoct(6)</B>, <B>xrubik(6)</B>, <B>xskewb(6)</B>, <B>xdino(6)</B>, xaba-
<B>cus(6)</B>
</PRE>
<H2>COPYRIGHTS</H2><PRE>
(R) Copyright 1996-2009, David A. Bagley
Main algorithm taken from AT&T paper above.
Thanks to Nick Baxter <nickb@baxterweb.com> for debugging level n > 4
and vTrick.
Though most code by Rene Jansen <rene.j.jansen@bigfoot.com> is now
removed, much inspiration was gained by his efforts implementing an
algorithm from Quantum January/February 1996 by Vladimir Dubrovsky.
</PRE>
<H2>BUG REPORTS AND PROGRAM UPDATES</H2><PRE>
Send bugs (or their reports, or fixes) to the author:
David A. Bagley, <<I>bagleyd@tux.org</I>>
The latest version is currently at:
<I>http://www.tux.org/~bagleyd/puzzles.html</I>
<I>ftp://ibiblio.org/pub/Linux/games/strategy</I>
V7.5.1 10 Nov 2009 <B>PANEX(6)</B>
</PRE>
<HR>
</BODY>
</HTML>
|
