{"id":"public-001-t1-000","prompt":"WELLS INSTANCE public-001-t1-000 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n2..3.3\n.0....\n...2..\n....1.\n.2..0.\n3.3..2\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t1-001","prompt":"WELLS INSTANCE public-001-t1-001 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.2.1..\n1..1..\n.1.2.3\n.1....\n22...2\n..1.1.\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t1-002","prompt":"WELLS INSTANCE public-001-t1-002 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.2...3\n...1..\n...1..\n4...1.\n..1...\n.3...3\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t1-003","prompt":"WELLS INSTANCE public-001-t1-003 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.1.3..\n..2...\n....11\n......\n.3...2\n3..2..\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t1-004","prompt":"WELLS INSTANCE public-001-t1-004 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n...3..\n.3...0\n....11\n..2...\n1.2..1\n1...2.\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t1-005","prompt":"WELLS INSTANCE public-001-t1-005 — 6 columns x 6 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.4...2\n....0.\n...110\n1...11\n..2.1.\n.2..11\n\nANSWER FORMAT\nGive the completed grid as 6 lines of 6 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-000","prompt":"WELLS INSTANCE public-001-t2-000 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n4...1.2.\n.....0.2\n.23...21\n.....2..\n....2.2.\n......12\n.2.3..21\n2...3...\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-001","prompt":"WELLS INSTANCE public-001-t2-001 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.43.....\n....2..3\n...2.1..\n2.2.0...\n...001..\n21..1...\n...1..34\n..3.....\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-002","prompt":"WELLS INSTANCE public-001-t2-002 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.4..12..\n........\n.......3\n.4....2.\n....2...\n3.......\n4....2..\n...1...3\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-003","prompt":"WELLS INSTANCE public-001-t2-003 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n4..3..2.\n.......2\n........\n.21..22.\n....3..2\n32......\n...3.1..\n.....2.2\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-004","prompt":"WELLS INSTANCE public-001-t2-004 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n32..3..1\n...32...\n........\n....23..\n...2....\n4......4\n.2......\n4...2...\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t2-005","prompt":"WELLS INSTANCE public-001-t2-005 — 8 columns x 8 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n2..1..12\n.2....2.\n....3.1.\n.3.....0\n.....3..\n...1....\n..0..3..\n22.2...2\n\nANSWER FORMAT\nGive the completed grid as 8 lines of 8 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-000","prompt":"WELLS INSTANCE public-001-t3-000 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n5......4..\n.3........\n.......4..\n.........6\n.34.......\n3...1.....\n...3......\n......3...\n..2..1....\n3..0...4..\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-001","prompt":"WELLS INSTANCE public-001-t3-001 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.2...11.11\n...2.21.1.\n....2.2.11\n2.3..2....\n.........2\n.3.....3..\n....2....3\n2...2..2..\n......1...\n4..3...212\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-002","prompt":"WELLS INSTANCE public-001-t3-002 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n1..1.....3\n2.2....4..\n.1........\n....3.....\n2..3...3..\n.0.......2\n.10..1....\n2..12.3...\n1..2....23\n2.2....3..\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-003","prompt":"WELLS INSTANCE public-001-t3-003 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n4....1...3\n4...1..2..\n.........2\n..21...1..\n.0........\n2....5...3\n..3.......\n....4..21.\n..3.......\n2......1.2\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-004","prompt":"WELLS INSTANCE public-001-t3-004 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n2....3...0\n.2......2.\n.1...2....\n....4...11\n..4..2....\n......2..2\n.3..2..0..\n..1..1....\n..........\n1.3..3...5\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t3-005","prompt":"WELLS INSTANCE public-001-t3-005 — 10 columns x 10 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n....2..2.2\n5.....2...\n.......2.1\n..2..2....\n.....2....\n..1.22....\n..1.....4.\n12.1......\n.2..2...3.\n2..1.1....\n\nANSWER FORMAT\nGive the completed grid as 10 lines of 10 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-000","prompt":"WELLS INSTANCE public-001-t4-000 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n..3..2.212..\n.3....2....2\n.........1..\n.5.........1\n.......23...\n.....4......\n............\n3......2....\n..4....1....\n...........6\n.....2......\n0.2......5..\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-001","prompt":"WELLS INSTANCE public-001-t4-001 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n3...3......4\n2.....2..2..\n....3...2...\n.......1....\n.4.4.......3\n.......3....\n.....2......\n......2.3...\n.3.....4...3\n............\n....3.......\n11........5.\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-002","prompt":"WELLS INSTANCE public-001-t4-002 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n..1........5\n2..2.3..2...\n....1.......\n2111..2..2..\n..1....2....\n.....3......\n.4.......322\n....22......\n........3...\n...1...1....\n....2.0..33.\n.5...2.0....\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-003","prompt":"WELLS INSTANCE public-001-t4-003 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n1.2.0...3..2\n..1....3....\n1..3..4....2\n.1.....5....\n..2...5.....\n2..........3\n............\n.2.2.1.3.12.\n1........2.0\n.......3....\n..3.3.....3.\n2.....2.....\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-004","prompt":"WELLS INSTANCE public-001-t4-004 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n..4...1..2..\n...2....2.2.\n.3....2....2\n.........3..\n....4......4\n1..3........\n.....4......\n3...........\n........33.2\n.....1....1.\n............\n.433..3...11\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t4-005","prompt":"WELLS INSTANCE public-001-t4-005 — 12 columns x 12 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.......4...7\n3.1......7..\n..1.........\n.....3......\n............\n.4..1....3..\n3...........\n..3..2.3..1.\n.........2..\n...2..2....2\n........0.21\n2...5....2..\n\nANSWER FORMAT\nGive the completed grid as 12 lines of 12 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-000","prompt":"WELLS INSTANCE public-001-t5-000 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.......5...12.\n.3............\n...0..........\n4...2....4....\n..2..0.......5\n..1...1.......\n.2..2....2....\n.....3.3...2..\n1.3..........1\n....2...2.2..2\n.....2...1....\n...3...2...22.\n.4......2.....\n6.....2....3.1\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-001","prompt":"WELLS INSTANCE public-001-t5-001 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n2....5........\n...2..........\n0.2.2.........\n1..2......5..4\n.11.........4.\n..............\n3..2...5......\n..........3...\n..............\n...4..........\n..............\n1...4.........\n.0......4.....\n2.2......4...8\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-002","prompt":"WELLS INSTANCE public-001-t5-002 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.......2...3..\n21.......1....\n...4......3...\n.....4...3....\n2.....2.......\n...2...2......\n2............5\n..3.3....3....\n.......0......\n......2..3....\n...2.2......4.\n.......2......\n5............3\n....2.3.12.2..\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-003","prompt":"WELLS INSTANCE public-001-t5-003 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n..1...2.2...2.\n.3..2..2...0..\n....2.........\n3...12...4...4\n..011.........\n...1...33.....\n........4...2.\n5.............\n....3.........\n...4.......4..\n.....2.1......\n...3.........4\n0.............\n..3.4...4.....\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-004","prompt":"WELLS INSTANCE public-001-t5-004 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.2.2...5.3...3\n0.0.1.....3...\n.1..........0.\n0..1..........\n..3...4.......\n.3......2..4..\n1..2.........4\n..21......2...\n.....2.2......\n......1.......\n32.3........1.\n..4........3..\n.4.......5...4\n......2.......\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}
{"id":"public-001-t5-005","prompt":"WELLS INSTANCE public-001-t5-005 — 14 columns x 14 rows\n\nRULE\nEvery cell of the finished grid holds one digit: the number of orthogonal\nsteps (up, down, left or right — never diagonal) from that cell to the\nnearest cell holding 0. A cell holding 0 is zero steps from itself.\n\nPUZZLE\nThe grid below is partly filled in. A dot marks a cell you must fill in.\nRows run top to bottom; within a row, columns run left to right.\nExactly one completed grid satisfies the rule, and it can be reached by\ndeduction alone — no guessing is required at any point.\n\n.....4..1...3.\n..4.2.....2...\n.......4...2..\n.3..........2.\n.2.....4..12..\n.3....333....3\n..2..........3\n......1.2.....\n1..3..1.....4.\n.3...1...2....\n..3...........\n2....3........\n.0.....4......\n2..3......3..6\n\nANSWER FORMAT\nGive the completed grid as 14 lines of 14 digits, with no spaces and no\nother characters, between the tags <answer> and </answer>. Every digit you\nwere given must appear unchanged in its original position. You may reason\nas much as you like before the tags; only the last <answer> block is read.\n"}