XML
| <?xml version="1.0" encoding="UTF-8" standalone="no"?>
<puzzle>
<id>156</id>
<runningOn>
<os>Windows 11</os>
<cores>24 </cores>
</runningOn>
<meta>
<start>2026-03-13 19:50:23</start>
<boxX>5</boxX>
<boxY>45</boxY>
<boxZ>1</boxZ>
<parts>35 in use</parts>
<title>ini/00156.ini</title>
<description>64.Problem</description>
<group>2D</group>
<groupBy>Nicht gruppiert</groupBy>
<boxType>2D</boxType>
<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>005045001AXNNNAX.NNAXXXNACXBBAC.BBACCBBECCQQEE.QQEEQQJETTJJTT.KJOTTKJOOOKJOO.KKRRRjKRjjjjRR.jWSSWWWSSSMWdS.MWdddMMYdaaMYd.aMYYYaaHHYFaHc.FFHccFFHHccFGG.chGhhhhGGgghPG.ggPPPgLPiPgLii.LLViibLVibbLVV.bbUVVfbUffffUf.IIUUUeIeeeeIeD.DIDDDDI</firstSolution>
<firstSolTime>00:00:01.5</firstSolTime>
<totalTime>00:00:01.7</totalTime>
<exit>stop</exit>
</finish>
<puzzleDefinition>
<!-- The puzzle definition pdef use a 2D or 3D Vector to describe a puzzle-->
<pdef>[0,0][0,1][0,2][0,3][0,4][0,5]</pdef>
<pdef>[0,0][1,0][0,1][1,1][0,2][1,2]</pdef>
<pdef>[0,0][0,1][0,2][1,2][0,3][1,3]</pdef>
<pdef>[0,0][0,1][1,1][0,2][0,3][1,3]</pdef>
<pdef>[0,0][0,1][1,1][0,2][1,2][0,3]</pdef>
<pdef>[0,0][0,1][1,1][0,2][1,2][1,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][0,3][1,3]</pdef>
<pdef>[0,0][1,0][0,1][0,2][0,3][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][1,3][0,4]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,3][1,4]</pdef>
<pdef>[0,0][0,1][0,2][1,2][0,3][0,4]</pdef>
<pdef>[0,0][0,1][0,2][1,2][1,3][1,4]</pdef>
<pdef>[0,0][0,1][1,1][0,2][1,2][2,2]</pdef>
<pdef>[0,0][0,1][1,1][2,1][0,2][1,2]</pdef>
<pdef>[0,0][0,1][1,1][2,1][0,2][2,2]</pdef>
<pdef>[0,0][0,1][1,1][2,1][1,2][2,2]</pdef>
<pdef>[0,0][0,1][2,1][0,2][1,2][2,2]</pdef>
<pdef>[0,0][1,0][0,1][1,1][2,1][1,2]</pdef>
<pdef>[0,0][1,0][1,1][2,1][0,2][1,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,3][2,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][1,3][2,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,2][0,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,2][1,3]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,2][2,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][1,3][2,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][2,2][1,3]</pdef>
<pdef>[0,0][0,1][1,1][1,2][2,2][2,3]</pdef>
<pdef>[0,0][0,1][1,1][2,1][1,2][1,3]</pdef>
<pdef>[0,0][1,0][1,1][1,2][1,3][2,3]</pdef>
<pdef>[0,0][1,0][1,1][1,2][2,2][1,3]</pdef>
<pdef>[0,0][1,0][1,1][2,1][1,2][1,3]</pdef>
<pdef>[0,0][1,0][2,0][1,1][1,2][1,3]</pdef>
<pdef>[1,0][0,1][1,1][1,2][2,2][1,3]</pdef>
<pdef>[1,0][0,1][1,1][2,1][1,2][1,3]</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>005045001AAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAAA</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/>
<solution>
<sol>005045001AXNNNAX.NNAXXXNACXBBAC.BBACCBBECCQQEE.QQEEQQJETTJJTT.KJOTTKJOOOKJOO.KKRRRjKRjjjjRR.jWSSWWWSSSMWdS.MWdddMMYdaaMYd.aMYYYaaHHYFaHc.FFHccFFHHccFGG.chGhhhhGGgghPG.ggPPPgLPiPgLii.LLViibLVibbLVV.bbUVVfbUffffUf.IIUUUeIeeeeIeD.DIDDDDI</sol>
</solution>
</missingParts>
<count>
<!-- stop reporting solutions @ 'maxListedSolution'-->
<maxListedSolution>512 </maxListedSolution>
<cntMissing>0 </cntMissing>
</count>
</solutions>
</puzzle>
|