prev
nextparts used so far
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<puzzle>
<meta>
<!-- These options are used for the process -->
<start>2026-11-07 13:25:06</start>
<boxX>5</boxX>
<boxY>13</boxY>
<boxZ>1</boxZ>
<title/>
<description>5*5 7*5 (24.Problem)</description>
<group>2D</group>
<groupBy>Rechteck doppelt</groupBy>
<boxType>2D</boxType>
<thread>256</thread>
<puzzles>pdef/2D_5.ini</puzzles>
<not>0</not>
<notAbs>0</notAbs>
<verbose>false</verbose>
<unique>true</unique>
<list>false</list>
<kill>60</kill>
<single>false</single>
<stop>4096</stop>
<rot/>
</meta>
<finish>
<!-- If process finish we see some results depending on exit condition -->
<uniqueSolutions>16 </uniqueSolutions>
<totalSolutions>16 </totalSolutions>
<firstSolution>013005001KKKJJ.LLLLLGGKAKJJ.BBCGGGFAAADJ.EBCCFFFHADDD.EBBCCIFHHHHD.EEEIIII</firstSolution>
<firstSolTime>00:00:00.0</firstSolTime>
<totalTime>00:00:00.1</totalTime>
<parts>12</parts>
<partsInUse>12</partsInUse>
<exit>DONE</exit>
</finish>
<puzzleDefinition>
<!-- This are the puzzle parts used to build the puzzle -->
<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,2][0,3][1,0][1,1][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][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][0,4]</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>013005001AAAAA.AAAAAAAAAAAA.AAAAAAAAAAAA.AAAAAAAAAAAA.AAAAAAAAAAAA.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 .... -->
<!-- The unused puzzle part {missing} is given in the vector format. -->
<solution>
<solstr>013005001DHHHH.LLLLLGGDDDAH.BBCGGGFJDAAA.EBCCFFFJJKAK.EBBCCIFJJKKK.EEEIIII</solstr>
</solution>
<solution>
<solstr>013005001HHHHD.GGLLLLLHADDD.FGGGCBBAAADJ.FFFCCBEKAKJJ.FICCBBEKKKJJ.IIIIEEE</solstr>
</solution>
<solution>
<solstr>013005001JJJDD.EEEIIIIJJDDH.EBBCCIFKKADH.EBCCFFFKAAAH.BBCGGGFKKAHH.LLLLLGG</solstr>
</solution>
<solution>
<solstr>013005001DDJJJ.EEEIIIIHDDJJ.EBBCCIFHDAKK.EBCCFFFHAAAK.BBCGGGFHHAKK.LLLLLGG</solstr>
</solution>
<solution>
<solstr>013005001DHHHH.GGLLLLLDDDAH.FGGGCBBJDAAA.FFFCCBEJJKAK.FICCBBEJJKKK.IIIIEEE</solstr>
</solution>
<solution>
<solstr>013005001HHHHD.IIIIEEEHADDD.FICCBBEAAADJ.FFFCCBEKAKJJ.FGGGCBBKKKJJ.GGLLLLL</solstr>
</solution>
<solution>
<solstr>013005001DHHHH.IIIIEEEDDDAH.FICCBBEJDAAA.FFFCCBEJJKAK.FGGGCBBJJKKK.GGLLLLL</solstr>
</solution>
<solution>
<solstr>013005001HHHHD.EEEIIIIHADDD.EBBCCIFAAADJ.EBCCFFFKAKJJ.BBCGGGFKKKJJ.LLLLLGG</solstr>
</solution>
<solution>
<solstr>013005001JJJDD.LLLLLGGJJDDH.BBCGGGFKKADH.EBCCFFFKAAAH.EBBCCIFKKAHH.EEEIIII</solstr>
</solution>
<solution>
<solstr>013005001DDJJJ.LLLLLGGHDDJJ.BBCGGGFHDAKK.EBCCFFFHAAAK.EBBCCIFHHAKK.EEEIIII</solstr>
</solution>
<solution>
<solstr>013005001DHHHH.EEEIIIIDDDAH.EBBCCIFJDAAA.EBCCFFFJJKAK.BBCGGGFJJKKK.LLLLLGG</solstr>
</solution>
<solution>
<solstr>013005001DDJJJ.GGLLLLLHDDJJ.FGGGCBBHDAKK.FFFCCBEHAAAK.FICCBBEHHAKK.IIIIEEE</solstr>
</solution>
<solution>
<solstr>013005001JJJDD.GGLLLLLJJDDH.FGGGCBBKKADH.FFFCCBEKAAAH.FICCBBEKKAHH.IIIIEEE</solstr>
</solution>
<solution>
<solstr>013005001JJJDD.IIIIEEEJJDDH.FICCBBEKKADH.FFFCCBEKAAAH.FGGGCBBKKAHH.GGLLLLL</solstr>
</solution>
<solution>
<solstr>013005001DDJJJ.IIIIEEEHDDJJ.FICCBBEHDAKK.FFFCCBEHAAAK.FGGGCBBHHAKK.GGLLLLL</solstr>
</solution>
<solution>
<solstr>013005001HHHHD.LLLLLGGHADDD.BBCGGGFAAADJ.EBCCFFFKAKJJ.EBBCCIFKKKJJ.EEEIIII</solstr>
</solution>
</solutions>
</puzzle>