<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<puzzle>
    <meta>
        <!-- These options are used for the process                                       -->
        <start>2026-10-31 19:16:39</start>
        <boxX>13</boxX>
        <boxY>13</boxY>
        <boxZ>1</boxZ>
        <title/>
        <description>13_13</description>
        <group>2D</group>
        <groupBy>Raute</groupBy>
        <boxType>2D</boxType>
        <thread>256</thread>
        <puzzles/>
        <not>0</not>
        <notAbs>0</notAbs>
        <verbose>false</verbose>
        <unique>true</unique>
        <list>false</list>
        <kill>1200</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>013013001......B...........BBA.........CBPAD.......ECBPADD.....GECPPADKK...GGECC.ADKII.GGNEF...KKHII.NNNFO.OHHHI...FFFOOOQQH.....LLLMMQQ.......LLJMM.........JJJ...........J......</firstSolution>
        <firstSolTime>00:00:00.0</firstSolTime>
        <totalTime>00:00:00.1</totalTime>
        <parts>17</parts>
        <partsInUse>17</partsInUse>
        <exit>stop</exit>
    </finish>
    <puzzleDefinition>
        <!-- This are the puzzle parts used to build the puzzle                           -->
        <pdef>[0,0,0][1,0,0][2,0,0][3,0,0][4,0,0]</pdef>
        <pdef>[2,0,0][3,0,0][0,1,0][1,1,0][2,1,0]</pdef>
        <pdef>[0,0,0][1,0,0][2,0,0][3,0,0][3,1,0]</pdef>
        <pdef>[0,0,0][1,0,0][2,0,0][3,0,0][2,1,0]</pdef>
        <pdef>[0,0,0][1,0,0][2,0,0][3,0,0]</pdef>
        <pdef>[2,0,0][2,1,0][0,2,0][1,2,0][2,2,0]</pdef>
        <pdef>[2,0,0][1,1,0][2,1,0][0,2,0][1,2,0]</pdef>
        <pdef>[2,0,0][0,1,0][1,1,0][2,1,0][2,2,0]</pdef>
        <pdef>[1,0,0][0,1,0][1,1,0][2,1,0][2,2,0]</pdef>
        <pdef>[1,0,0][0,1,0][1,1,0][2,1,0][1,2,0]</pdef>
        <pdef>[0,0,0][0,1,0][1,1,0][2,1,0][2,2,0]</pdef>
        <pdef>[1,0,0][2,0,0][0,1,0][1,1,0][2,1,0]</pdef>
        <pdef>[1,0,0][2,0,0][0,1,0][1,1,0]</pdef>
        <pdef>[1,0,0][0,1,0][1,1,0][2,1,0]</pdef>
        <pdef>[0,0,0][2,0,0][0,1,0][1,1,0][2,1,0]</pdef>
        <pdef>[0,0,0][1,0,0][2,0,0][2,1,0]</pdef>
        <pdef>[0,0,0][1,0,0][0,1,0][1,1,0]</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>013013001......A...........AAA.........AAAAA.......AAAAAAA.....AAAAAAAAA...AAAAA.AAAAA.AAAAA...AAAAA.AAAAA.AAAAA...AAAAAAAAA.....AAAAAAA.......AAAAA.........AAA...........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>013013001......B...........BBA.........CBPAD.......ECBPADD.....GECPPADKK...GGECC.ADKII.GGNEF...KKHII.NNNFO.OHHHI...FFFOOOQQH.....LLLMMQQ.......LLJMM.........JJJ...........J......</solstr>
        </solution>
    </solutions>
</puzzle>