<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<puzzle>
<meta>
<!-- These options are used for the process -->
<start>2026-10-31 19:27:05</start>
<boxX>15</boxX>
<boxY>21</boxY>
<boxZ>1</boxZ>
<title/>
<description>66.Problem</description>
<group>2D</group>
<groupBy>Schach</groupBy>
<boxType>2D</boxType>
<thread>256</thread>
<puzzles>pdef/2D_6.ini</puzzles>
<not>0</not>
<notAbs>0</notAbs>
<verbose>false</verbose>
<unique>true</unique>
<list>false</list>
<kill>10</kill>
<single>false</single>
<stop>1</stop>
<rot/>
</meta>
<finish>
<!-- If process finish we see some results depending on exit condition -->
<uniqueSolutions>1 </uniqueSolutions>
<totalSolutions>1 </totalSolutions>
<firstSolution>015021001LLCCDNNNNEEgggg.LLCDDDDNFEEgg...LCHHDBNFEXY....LCCHBBBFEXY....MMMHHBFFFXY...VVVMMHBGGXXYK..VVcMccGGIXYYK...VcccGGIIIKKK....UUUOIIJJKQQ.....UUOJJJaQQj......UOOOJaQQj.......Oiiiaffj........iiiaafj.........RRaffj.SSS..dddRRRAfj...STTTdddRAAAA.hSShTbbbbbWPAP.hhhhTT.beeWPPP.......eeeeWWP.............W..............W...</firstSolution>
<firstSolTime>00:00:00.8</firstSolTime>
<totalTime>00:00:00.8</totalTime>
<parts>35</parts>
<partsInUse>35</partsInUse>
<exit>stop</exit>
</finish>
<puzzleDefinition>
<!-- This are the puzzle parts used to build the 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,1][1,1][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][1,3][2,2]</pdef>
<pdef>[0,0][0,1][1,1][1,2][1,3][2,1]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,2][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][1,3][2,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,2][2,2]</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,1][2,2]</pdef>
<pdef>[0,0][0,1][1,0][1,1][1,2][2,1]</pdef>
<pdef>[0,0][0,1][0,2][1,2][2,1][2,2]</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,2][1,3][1,4]</pdef>
<pdef>[0,0][0,1][0,2][0,3][1,3][1,4]</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,3][1,1][1,2][1,3]</pdef>
<pdef>[0,0][0,1][0,2][1,1][1,2][1,3]</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][1,0][1,1][1,2]</pdef>
<pdef>[0,0][0,1][0,2][0,3][0,4][0,5]</pdef>
</puzzleDefinition>
<boxDefinition>
<!-- Here we define the puzzle -->
<!-- The box definition bdef starts with 9 char for boxX,boxY,boxZ -->
<!-- followd by 'A' for a box or '.' for a whole -->
<bdef>015021001AAAAAAAAAAAAAAA.AAAAAAAAAAAAA...AAAAAAAAAAA....AAAAAAAAAAA....AAAAAAAAAAA...AAAAAAAAAAAAA..AAAAAAAAAAAAA...AAAAAAAAAAAA....AAAAAAAAAAA.....AAAAAAAAAA......AAAAAAAAA.......AAAAAAAA........AAAAAAA.........AAAAAA.AAA..AAAAAAAAA...AAAAAAAAAAAA.AAAAAAAAAAAAAA.AAAAAA.AAAAAAA.......AAAAAAA.............A..............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 .... -->
<!-- The unused puzzle part {missing} is given in the vector format. -->
<solution>
<solstr>015021001LLCCDNNNNEEgggg.LLCDDDDNFEEgg...LCHHDBNFEXY....LCCHBBBFEXY....MMMHHBFFFXY...VVVMMHBGGXXYK..VVcMccGGIXYYK...VcccGGIIIKKK....UUUOIIJJKQQ.....UUOJJJaQQj......UOOOJaQQj.......Oiiiaffj........iiiaafj.........RRaffj.SSS..dddRRRAfj...STTTdddRAAAA.hSShTbbbbbWPAP.hhhhTT.beeWPPP.......eeeeWWP.............W..............W...</solstr>
</solution>
</solutions>
</puzzle>