XML


<?xml version="1.0" encoding="UTF-8" standalone="no"?> <puzzle> <id>427</id> <runningOn> <os>Windows 11</os> <cores>24 </cores> </runningOn> <meta> <start>2026-03-13 20:01:54</start> <boxX>9</boxX> <boxY>10</boxY> <boxZ>1</boxZ> <parts>12 in use</parts> <title>ini/00427.ini</title> <description/> <group>2D</group> <groupBy>Parallelogram</groupBy> <boxType>2D</boxType> <puzzles>pdef/2D_5.ini</puzzles> <not>0</not> <notAbs>0</notAbs> <verbose>false</verbose> <unique>true</unique> <list>true</list> <kill>60</kill> <stop>1</stop> <rot> </rot> </meta> <finish> <uniqueSolutions>1 </uniqueSolutions> <totalSolutions>1 </totalSolutions> <firstSolution>009010001AJJCC....AAJFC.....AJFCC....AJFFF.....DKKKK....DDKEE.....DDGEE....GGGEH.....IGIHH....IIIHH</firstSolution> <firstSolTime>00:00:00.0</firstSolTime> <totalTime>00:00:00.2</totalTime> <exit>stop</exit> </finish> <puzzleDefinition> <!-- The puzzle definition pdef use a 2D or 3D Vector to describe a puzzle--> <pdef>[0,2][0,3][1,0][1,1][1,2]</pdef> <pdef>[0,1][1,0][1,1][1,2][2,1]</pdef> <pdef>[0,0][0,1][1,1][2,1][2,2]</pdef> <pdef>[0,0][0,1][1,1][1,2][2,2]</pdef> <pdef>[0,0][0,1][1,1][1,2][2,1]</pdef> <pdef>[0,0][0,1][0,2][1,2][2,2]</pdef> <pdef>[0,0][0,1][0,2][1,1][2,1]</pdef> <pdef>[0,0][0,1][0,2][1,1][1,2]</pdef> <pdef>[0,0][0,1][0,2][1,0][1,2]</pdef> <pdef>[0,0][0,1][0,2][0,3][1,3]</pdef> <pdef>[0,0][0,1][0,2][0,3][1,1]</pdef> <pdef>[0,0][0,1][0,2][0,3][0,4]</pdef> </puzzleDefinition> <boxDefinition> <!-- The box definition bdef starts with 9 char for boxX,boxY,boxZ--> <!-- followd by 'A' for a box or '.' for a whole--> <bdef>009010001AAAAA....AAAAA.....AAAAA....AAAAA.....AAAAA....AAAAA.....AAAAA....AAAAA.....AAAAA....AAAAA</bdef> </boxDefinition> <solutions> <!-- The solution solStr starts with 9 char for boxX,boxY,boxZ--> <!-- followed by a base 60 notation--> <!-- Syntax 1 chars first A:0, B:1 ....: a:25, b:25 0:50,1:51 ...--> <!-- 3 chars next _AA _AB ....--> <missingParts> <missingPdef>1 11</missingPdef> <missing>[0,1][1,0][1,1][1,2][2,1]</missing> <missing>[0,0][0,1][0,2][0,3][0,4]</missing> <solution> <sol>009010001AJJCC....AAJFC.....AJFCC....AJFFF.....DKKKK....DDKEE.....DDGEE....GGGEH.....IGIHH....IIIHH</sol> </solution> </missingParts> <count> <!-- stop reporting solutions @ 'maxListedSolution'--> <maxListedSolution>512 </maxListedSolution> <cntMissing>0 </cntMissing> </count> </solutions> </puzzle>

Rolf LANG - Remsstr. 39 - 71384 Weinstadt | 04:19:00 up 131 days, 9:29, 1 user, load average: 3.60, 3.98, 3.78