XML
| <?xml version="1.0" encoding="UTF-8" standalone="no"?>
<puzzle>
<id>553</id>
<runningOn>
<os>Windows 11</os>
<cores>24 </cores>
</runningOn>
<meta>
<start>2026-03-13 20:03:06</start>
<boxX>13</boxX>
<boxY>13</boxY>
<boxZ>1</boxZ>
<parts>35 in use</parts>
<title>ini/00553.ini</title>
<description>13_13</description>
<group>2D</group>
<groupBy>Dreieck</groupBy>
<boxType>2D</boxType>
<puzzles>pdef/2D_6.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>013013001CCRRRDDEhhhhhYCJJRRDEEEEh.YC.JRODDEKK..YCCJJODKKK...YYYAJOOOK....IIAAVVVO.....IIIAAVV......MMIAHV.......MMMHH........eMHH.........eeH..........ee...........e............</firstSolution>
<firstSolTime>00:00:00.1</firstSolTime>
<totalTime>00:00:00.3</totalTime>
<exit>stop</exit>
</finish>
<puzzleDefinition>
<!-- The puzzle definition pdef use a 2D or 3D Vector to describe a puzzle-->
<pdef>[0,1][1,0][1,1][1,2][1,3][2,2]</pdef>
<pdef>[0,1][1,0][1,1][1,2][1,3][2,1]</pdef>
<pdef>[0,0][1,0][1,1][1,2][1,3][2,3]</pdef>
<pdef>[0,0][1,0][1,1][1,2][1,3][2,2]</pdef>
<pdef>[0,0][1,0][1,1][1,2][1,3][2,1]</pdef>
<pdef>[0,0][1,0][1,1][1,2][1,3][2,0]</pdef>
<pdef>[0,0][0,2][1,0][1,1][1,2][2,1]</pdef>
<pdef>[0,0][0,1][1,1][1,2][2,2][2,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][2,1][2,2]</pdef>
<pdef>[0,0][0,1][1,1][1,2][1,3][2,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][1,3][2,2]</pdef>
<pdef>[0,0][0,1][1,1][1,2][1,3][2,1]</pdef>
<pdef>[0,0][0,1][1,0][1,1][1,2][2,1]</pdef>
<pdef>[0,0][0,1][0,3][1,1][1,2][1,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,2][2,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,1][2,2]</pdef>
<pdef>[0,0][0,1][0,2][1,2][1,3][2,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][1,3][2,2]</pdef>
<pdef>[0,0][0,1][0,2][1,2][1,3][1,4]</pdef>
<pdef>[0,0][0,1][0,2][1,1][2,1][2,2]</pdef>
<pdef>[0,0][0,1][0,2][1,1][1,2][2,2]</pdef>
<pdef>[0,0][0,1][0,2][1,1][1,2][2,1]</pdef>
<pdef>[0,0][0,1][0,2][1,1][1,2][1,3]</pdef>
<pdef>[0,0][0,1][0,2][1,0][1,1][1,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,3][2,3]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,3][1,4]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,2][2,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,2][1,3]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,1][1,3]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,1][1,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,0][1,3]</pdef>
<pdef>[0,0][0,1][0,2][0,3][0,4][1,4]</pdef>
<pdef>[0,0][0,1][0,2][0,3][0,4][1,3]</pdef>
<pdef>[0,0][0,1][0,2][0,3][0,4][1,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][0,4][0,5]</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>013013001AAAAAAAAAAAAAAAAAAAAAAAAA.AA.AAAAAAAA..AAAAAAAAAA...AAAAAAAAA....AAAAAAAA.....AAAAAAA......AAAAAA.......AAAAA........AAAA.........AAA..........AA...........A............</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 5 6 11 13 15 16 18 19 20 22 23 25 26 27 28 30 31 33 34</missingPdef>
<missing>[0,1][1,0][1,1][1,2][1,3][2,1]</missing>
<missing>[0,0][1,0][1,1][1,2][1,3][2,0]</missing>
<missing>[0,0][0,2][1,0][1,1][1,2][2,1]</missing>
<missing>[0,0][0,1][1,1][1,2][1,3][2,1]</missing>
<missing>[0,0][0,1][0,3][1,1][1,2][1,3]</missing>
<missing>[0,0][0,1][0,2][1,2][2,1][2,2]</missing>
<missing>[0,0][0,1][0,2][1,2][1,3][2,3]</missing>
<missing>[0,0][0,1][0,2][1,2][1,3][1,4]</missing>
<missing>[0,0][0,1][0,2][1,1][2,1][2,2]</missing>
<missing>[0,0][0,1][0,2][1,1][1,2][2,2]</missing>
<missing>[0,0][0,1][0,2][1,1][1,2][1,3]</missing>
<missing>[0,0][0,1][0,2][1,0][1,1][1,2]</missing>
<missing>[0,0][0,1][0,2][0,3][1,3][1,4]</missing>
<missing>[0,0][0,1][0,2][0,3][1,2][2,2]</missing>
<missing>[0,0][0,1][0,2][0,3][1,2][1,3]</missing>
<missing>[0,0][0,1][0,2][0,3][1,1][1,3]</missing>
<missing>[0,0][0,1][0,2][0,3][1,0][1,3]</missing>
<missing>[0,0][0,1][0,2][0,3][0,4][1,4]</missing>
<missing>[0,0][0,1][0,2][0,3][0,4][1,2]</missing>
<missing>[0,0][0,1][0,2][0,3][0,4][0,5]</missing>
<solution>
<sol>013013001CCRRRDDEhhhhhYCJJRRDEEEEh.YC.JRODDEKK..YCCJJODKKK...YYYAJOOOK....IIAAVVVO.....IIIAAVV......MMIAHV.......MMMHH........eMHH.........eeH..........ee...........e............</sol>
</solution>
</missingParts>
<count>
<!-- stop reporting solutions @ 'maxListedSolution'-->
<maxListedSolution>512 </maxListedSolution>
<cntMissing>0 </cntMissing>
</count>
</solutions>
</puzzle>
|