Pentomino tiling: Difference between revisions

← Older edit

Pentomino tiling (view source)

Revision as of 11:43, 24 January 2024

49,177 bytes added , 4 months ago

m

→‎{{header|Wren}}: Minor tidy

PureFox

9,486

edits

Revision as of 11:43, 10 January 2022 (view source) rosettacode>Fwend m (no loinger draft) ← Older edit		Latest revision as of 11:43, 24 January 2024 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Minor tidy)
(14 intermediate revisions by 9 users not shown)
Line 38: * [[Free_polyominoes_enumeration\|Free polyominoes enumeration]] <br><br> =={{header\|11l}}== {{trans\|Nim}} <syntaxhighlight lang="11l"> F nonrandom(n) UInt32 :seed = 0 :seed = 1664525 * :seed + 1013904223 R (:seed >> 16) % n -V SF = [[1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0], [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0], [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1], [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]] SI = [[0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]] SL = [[1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0], [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0], [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0], [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]] SN = [[0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1], [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1], [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]] SP = [[0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1], [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1], [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0], [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]] ST = [[0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0], [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]] SU = [[0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1], [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]] SV = [[1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0], [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]] SW = [[1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1], [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]] SX = [[1, -1, 1, 0, 1, 1, 2, 0]] SY = [[1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0], [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0], [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0], [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]] SZ = [[0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2], [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]] Shapes = [SF, SI, SL, SN, SP, ST, SU, SV, SW, SX, SY, SZ] Symbols = Array(‘FILNPTUVWXYZ-’) NRows = 8 NCols = 8 Blank = Shapes.len T Tiling [[[Int]]] shapes [Char] symbols [[Int]] grid [Bool] placed F () V indexes = [4, 6, 11, 7, 10, 3, 9, 5, 1, 8, 0, 2] L(index) indexes .shapes.append(Shapes[index]) .symbols.append(Symbols[index]) .symbols.append(Symbols.last) .grid = [[-1] * NCols] * NRows L 4 L V randRow = nonrandom(NRows) V randCol = nonrandom(NCols) I .grid[randRow][randCol] != Blank .grid[randRow][randCol] = Blank L.break .placed = [0B] * Shapes.len F tryPlaceOrientation(o, r, c, shapeIndex) L(i) (0 .< o.len).step(2) V x = c + o[i + 1] V y = r + o[i] I x !C 0 .< NCols \| y !C 0 .< NRows \| .grid[y][x] != -1 R 0B .grid[r][c] = shapeIndex L(i) (0 .< o.len).step(2) .grid[r + o[i]][c + o[i + 1]] = shapeIndex R 1B F removeOrientation(o, r, c) .grid[r][c] = -1 L(i) (0 .< o.len).step(2) .grid[r + o[i]][c + o[i + 1]] = -1 F solve(pos, numPlaced) I numPlaced == .shapes.len R 1B V row = pos I/ NCols V col = pos % NCols I .grid[row][col] != -1 R .solve(pos + 1, numPlaced) L(i) 0 .< .shapes.len I !.placed[i] L(orientation) .shapes[i] I !.tryPlaceOrientation(orientation, row, col, i) L.continue .placed[i] = 1B I .solve(pos + 1, numPlaced + 1) R 1B .removeOrientation(orientation, row, col) .placed[i] = 0B R 0B F printResult() L(r) .grid print(r.map(i -> @.symbols[i]).join(‘ ’)) V tiling = Tiling() I tiling.solve(0, 0) tiling.printResult() E print(‘No solution’) </syntaxhighlight> {{out}} <pre> P P U U U V V V P P U X U L L V T P X X X L - V T T T X F L Z Z T - F F F L Z Y N N N F W Z Z Y - - N N W W Y Y I I I I I W W Y </pre> =={{header\|BASIC}}== ==={{header\|Visual Basic .NET}}=== {{trans\|Java}}via{{trans\|C#}} Instead of having a large declaration for each rotation of each pentomino, a small array of encoded positions is supplied '''(seeds)''', and it is expanded into the set of 63 possible orientations. However, the additional expansion routines code does take up about 2/3 of the space that would have been taken by the elaborate Integer array definitions. <syntaxhighlight lang="vbnet">Module Module1 Dim symbols As Char() = "XYPFTVNLUZWI█".ToCharArray(), nRows As Integer = 8, nCols As Integer = 8, target As Integer = 12, blank As Integer = 12, grid As Integer()() = New Integer(nRows - 1)() {}, placed As Boolean() = New Boolean(target - 1) {}, pens As List(Of List(Of Integer())), rand As Random, seeds As Integer() = {291, 292, 293, 295, 297, 329, 330, 332, 333, 335, 378, 586} Sub Main() Unpack(seeds) : rand = New Random() : ShuffleShapes(2) For r As Integer = 0 To nRows - 1 grid(r) = Enumerable.Repeat(-1, nCols).ToArray() : Next For i As Integer = 0 To 3 Dim rRow, rCol As Integer : Do : rRow = rand.Next(nRows) : rCol = rand.Next(nCols) Loop While grid(rRow)(rCol) = blank : grid(rRow)(rCol) = blank Next If Solve(0, 0) Then PrintResult() Else Console.WriteLine("no solution for this configuration:") : PrintResult() End If If System.Diagnostics.Debugger.IsAttached Then Console.ReadKey() End Sub Sub ShuffleShapes(count As Integer) ' changes order of the pieces for a more random solution For i As Integer = 0 To count : For j = 0 To pens.Count - 1 Dim r As Integer : Do : r = rand.Next(pens.Count) : Loop Until r <> j Dim tmp As List(Of Integer()) = pens(r) : pens(r) = pens(j) : pens(j) = tmp Dim ch As Char = symbols(r) : symbols(r) = symbols(j) : symbols(j) = ch Next : Next End Sub Sub PrintResult() ' display results For Each r As Integer() In grid : For Each i As Integer In r Console.Write("{0} ", If(i < 0, ".", symbols(i))) Next : Console.WriteLine() : Next End Sub ' returns first found solution only Function Solve(ByVal pos As Integer, ByVal numPlaced As Integer) As Boolean If numPlaced = target Then Return True Dim row As Integer = pos \ nCols, col As Integer = pos Mod nCols If grid(row)(col) <> -1 Then Return Solve(pos + 1, numPlaced) For i As Integer = 0 To pens.Count - 1 : If Not placed(i) Then For Each orientation As Integer() In pens(i) If Not TPO(orientation, row, col, i) Then Continue For placed(i) = True : If Solve(pos + 1, numPlaced + 1) Then Return True RmvO(orientation, row, col) : placed(i) = False Next : End If : Next : Return False End Function ' removes a placed orientation Sub RmvO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer) grid(row)(col) = -1 : For i As Integer = 0 To ori.Length - 1 Step 2 grid(row + ori(i))(col + ori(i + 1)) = -1 : Next End Sub ' checks an orientation, if possible it is placed, else returns false Function TPO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer, ByVal sIdx As Integer) As Boolean For i As Integer = 0 To ori.Length - 1 Step 2 Dim x As Integer = col + ori(i + 1), y As Integer = row + ori(i) If x < 0 OrElse x >= nCols OrElse y < 0 OrElse y >= nRows OrElse grid(y)(x) <> -1 Then Return False Next : grid(row)(col) = sIdx For i As Integer = 0 To ori.Length - 1 Step 2 grid(row + ori(i))(col + ori(i + 1)) = sIdx Next : Return True End Function '!' the following routines expand the seed values into the 63 orientation arrays. ' source code space savings comparison: ' around 2000 chars for the expansion code, verses about 3000 chars for the integer array defs. ' perhaps not worth the savings? Sub Unpack(sv As Integer()) ' unpacks a list of seed values into a set of 63 rotated pentominoes pens = New List(Of List(Of Integer())) : For Each item In sv Dim Gen As New List(Of Integer()), exi As List(Of Integer) = Expand(item), fx As Integer() = ToP(exi) : Gen.Add(fx) : For i As Integer = 1 To 7 If i = 4 Then Mir(exi) Else Rot(exi) fx = ToP(exi) : If Not Gen.Exists(Function(Red) TheSame(Red, fx)) Then Gen.Add(ToP(exi)) Next : pens.Add(Gen) : Next End Sub ' expands an integer into a set of directions Function Expand(i As Integer) As List(Of Integer) Expand = {0}.ToList() : For j As Integer = 0 To 3 : Expand.Insert(1, i And 15) : i >>= 4 : Next End Function ' converts a set of directions to an array of y, x pairs Function ToP(p As List(Of Integer)) As Integer() Dim tmp As List(Of Integer) = {0}.ToList() : For Each item As Integer In p.Skip(1) tmp.Add(tmp.Item(item >> 2) + {1, 8, -1, -8}(item And 3)) : Next tmp.Sort() : For i As Integer = tmp.Count - 1 To 0 Step -1 : tmp.Item(i) -= tmp.Item(0) : Next Dim res As New List(Of Integer) : For Each item In tmp.Skip(1) Dim adj = If((item And 7) > 4, 8, 0) res.Add((adj + item) \ 8) : res.Add((item And 7) - adj) Next : Return res.ToArray() End Function ' compares integer arrays for equivalency Function TheSame(a As Integer(), b As Integer()) As Boolean For i As Integer = 0 To a.Count - 1 : If a(i) <> b(i) Then Return False Next : Return True End Function Sub Rot(ByRef p As List(Of Integer)) ' rotates a set of directions by 90 degrees For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or ((p(i) + 1) And 3) : Next End Sub Sub Mir(ByRef p As List(Of Integer)) ' mirrors a set of directions For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or (((p(i) Xor 1) + 1) And 3) : Next End Sub End Module </syntaxhighlight> {{out}} Solution found result ''(typical output)'': <pre>Y F F █ L L L L Y Y F F L P P P Y T F N N N P P Y T N N █ V V V T T T W W Z Z V U U X █ W W Z V U X X X █ W Z Z U U X I I I I I </pre> Impossible to solve result ''(a somewhat rare occurrence)'': <pre>no solution for this configuration: . █ . . . . . . █ . . █ . . . . . . . . . . . . . . . . █ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . </pre> ====VB .NET alternative output ''(corner characters)''==== This output may appear better in a command window [https://tio.run/##rRlLc9u4@e5fgeoQExNKI8nOxvHE7iS20/HUSTySs952eoEoSIJDEVyAlKXNZKbTcw896LCHPfbY4x731@iPpN8H8AWKspN2lRnSBPC938hi1A6k4l@@vJXjNOTEvnp7ZI/A71zMiV7NRzLU5JUmZzOmPEpOSOuHv1y/ufn@3dWHv95etludG4lbr5RiK4/6BhR/0UDeG8DLKOFTrgDyyCfRWYauulrAJExNeeJu9/o@GYUs@ri1XIBNlRhXdj1q@HzH74sVy0yb9HDr0@cSNA5ZwA3waylDzqICNP/OeEJYF5JHRpAroRPv/aR4F0xQ6hPFIoN8AG85L4E152PtsAxUP/Vf9HzSf9HHxwE@nuHjuU8O@i/gcdDFRx8fB/iA3YPnoNNnR999zmw2TEfkLRMgRUHqQxSz4KNnKFJybFmyIlquPFwdztLJJOTDGYu59vol@BupiHJV3yU3khQaLU7mlvAUCnMRpXOu2CjknQGPOUu8di8zPwWXydwFKL/jy8ShJhqoHThU0DMV0Af9Ar7q8WNyLlFG2ARQFLWD@K39jfQI4OwYjhz0V1LG5HYmICKsPABMPYREwawvHu/cKlA5gl1OyFCGC@6BDbuU3Mx45NC8ViJKBlynYVKx3UWouXPsTEYa3LJzq0TCr0TEvVYkCSyliZARmYD6kpnQJJDRRExTxXD5uIWS76AAznA5cdhc6YTPO@eCTSOpExHozjkfpVNQb@dSv0oSFswgYlCCgp0BZ@M/81WGF3GCI1Zc0vWuQKZRNcgp2SfBjEVTrolUYzCjnIAYnMSCB7CGUjEyh0xl7CbnhcCP@o0ldWz27/JFjNzOmdmp@2/hXU1O5fhNiQSVa1zmQ5SIEI69PCV3jViTeVzNGGWmAMyIDyPnuPgrW7sr1u5wDXA04g5meZKGQ1natvgqH@XOXXXHIA5mDl4Ushqd20Z1HApMOBYasumKTFgUrIgyG3rP0So3OW@YAOQUSNo/OhfzOFk5prwAH3NsAAQuI5vnj8sTjsVhX21pBik@KQgB4BwSUetT93PLB1/3BHlJICBbHfjMlSEgcTdpIkPVgn9PyGJ0NannLic2vTOpIq742Du/9QA0R@qqcR@wJqmCQjIRSifg6SnsF@Eso9Dq5U0aBWbF5pDXq@9ZSGJZrSA@sauQdq@LmlYEWFnfqqFenj3JS68J64FhityolLv2g6zqxBiy8Deb1H2ItXB7F1oKu1@la1MnZs4AEyfES7vnULZiIvxTglUj55M@GvBubIOJgNw7mWR1Hoy7nXodp5NK8CgxaXPL/UwQCroFnEmFZG6u33sVFD6qzGjGJxlpdJNERClHmo2oSlZPjAmsELtUgp90t9mqv8F8sYM7k2IqZN@weuGpBIItGZn3wysjW8LggdxjK44@lwsIIZa3XBVGipRiOLR@DNuOAXL/dn0wX3V9j@65/UjhaSfoaMc7nQdodq54NE1mxnmGCY9Jv6G/ARae4mHMFYg4/zK2KKjsSJ1Y63jwETQREccYYoIRowW0TEQkBKq41ZRPOGi2zBSFnousgF73/2vN33Yae0xfjpePZZP/XaWYWJYuZF2lPlm5B6oW2KuF4RJzOnmvsHeCj9OTbObIVlbV7ZXZNp2sXdlSgTH4inrLpjTlhkkWDlsuh@r7HfT0la7nUHMjtEgMTQH6h33Tck1kGMp7LM9KQhGKIGL5MsaRAXdxiCALFqawDMVfmsXvDpysybCz153M12HUkakKONh0DPAwisCTLYAANqnzmCmhoUMtTsOPKVMF@91uF9tCpbO2lltONBJBbD5ZcKUxpYyAVXKwfV5kOjYskTGfVNiKuYJuVJMIsva9VKB3I6Bl7Y@VNiefnxZOYGHDk5odTGkhdHTYtG7ph8GS2QElKQkagn0oI4mci0hy7Q6Tdih7YJ50eh9o0rEo6cVWNP2Jm9pVRVYigWyyFA1dqJnZjKU9RE23s8FkWR9Yb@S1B9iQL6DZeTUee5MlbU6wPfTy53sNdVPA7qGNq7dCWYQmOgcyMV9NnDjEs@KLPFwsQSzt5d7tDaBpQNxDNuf44QMwzeplznOOqbHtMw0FnoLT9KGsbsPEpPXc71wXGAvFDVPazd651usptm6gcmazAXlCoI@FUdqco8WQ0zA8Y9E2MJ3LSHOVeNBAADnA0XuGgIKcnqINatJt1XCYKiHkEt0kE0FRs@jHnZUPyTdm0NbWahUou2kKotTxrr3H5ybarIEyOtzhIO4MP4rY67lWBtTGuvi@BCDj/KAO0qeQUj@Boo58gjcX7aPPdg/VdkC3bi4QwRDyiLfD/3G/7EvBKl2b5E2rUFKnpH1Sfna3yFTGqIb4bswQhrMG0REVG@NUDJNQKdtzSk7JoZG76wIAXaMrD6GeGvwU2v8jaqcju1fF00b8dEc1QojiHughn8MiYfNpmcxtjuc/pgKyLYd5s@ZkWcCzWjM0quXwb2hkWH2qYGgs6AlG@VDxYFfwFSXYNMCQ8l6vBhxaweYY2c/KSHMMjlbkRRcK3VTxSnHZOSs5IsW29ffMGw3YPqTQFRHPrpgxw/r@w9cCmMMfEWEulJJK70yNvwfTdukHwNL7SuaxBSqaHnQve5EBK3GauP4FM33lJoNWLjX2yVim2MFzyJQr04@wIDG1gGh7hC8DHifQM0R8gpeyZWzf1u5EqtFcud/Bqo@XUrd4HwHrTzCA4X1iriV80mrBUDejX5/OLcvtezGGNojpQAiSoNtm9SvIrjJMv5WPa4UuiouOZo04mQtl1h51LoF0ZxiHIvGQd/rt10U5Wuckpkb74bUIaMPS7dK8xbZDRcj04zfPBrTSmjsZETHAQUP/2L7yGyJLUtDy5ug6/emnkHsIYzmi2UVS841xmSbhWA4LUH6zdJ0rhkWwKuEDWRUSCNidmzIB8kIbbY0J9h5z@J6jKNgQg@0xNDMfyC7JXAfIeGOlBbJEm/nCt9sUsqvHckkgw2Z/Zml2hMqs64CVJiqON@N7WcfHmvCNSnxsC9/uGlEA9fcariFbpNffrNeHm/XPm/XfN@tfjzbrf2zW/9ysf9ms/7VZ/3uz/s9m/VvLg3hmNrOxYgTu@iaT1cZdb5QdqJ81/UuJB6uUWT/M1kfFeglzROljvtjkUvhp/@vwy5f/Ag Try it online!] {{out}} Solution found result ''(typical output)'': <pre>┌─────┬─────┬─┬─┐ │ ┌─┐ ├─┐ │ │ │ ├─┼─┴─┴─┴─┬─┘ │ │ │ └───┬─┐ │ ┌─┤ │ │ ┌───┼─┼─┴─┘ │ │ ├─┘ ┌─┘ └─┐ ┌─┼─┤ │ ┌─┼─┐ ┌─┴─┘ │ │ ├─┴─┘ └─┤ ┌───┘ │ └───────┴─┴─────┘</pre> Impossible to solve result ''(a somewhat rare occurrence)'': <pre>no solution for this configuration: ┌─┬─┬─┬─┬───────┐ │ └─┘ └─┘ │ │ ┌─┐ │ ├─┼─┘ │ ├─┘ │ │ │ │ │ │ │ └───────────────┘</pre> =={{header\|C sharp\|C#}}== {{trans\|Java}} <~~lang~~syntaxhighlight lang="csharp">using System; using System.Linq; Line 215 ⟶ 532: static readonly int[][][] shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z }; } }</~~lang~~syntaxhighlight> <pre>I N F F - - L L I N N F F P P L Line 224 ⟶ 541: U Y U T Z Z Z V U U U T Z V V V</pre> =={{header\|C++}}== <syntaxhighlight lang="c++"> #include <algorithm> #include <cstdint> #include <iostream> #include <random> #include <vector> const std::vector<std::vector<int32_t>> F = { { 1, -1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 1, -1, 1, 0, 2, 0 }, { 1, 0, 1, 1, 1, 2, 2, 1 }, { 1, 0, 1, 1, 2, -1, 2, 0 }, { 1, -2, 1, -1, 1, 0, 2, -1 }, { 0, 1, 1, 1, 1, 2, 2, 1 }, { 1, -1, 1, 0, 1, 1, 2, -1 }, { 1, -1, 1, 0, 2, 0, 2, 1 } }; const std::vector<std::vector<int32_t>> I = { { 0, 1, 0, 2, 0, 3, 0, 4 }, { 1, 0, 2, 0, 3, 0, 4, 0 } }; const std::vector<std::vector<int32_t>> L = { { 1, 0, 1, 1, 1, 2, 1, 3 }, { 1, 0, 2, 0, 3, -1, 3, 0 }, { 0, 1, 0, 2, 0, 3, 1, 3 }, { 0, 1, 1, 0, 2, 0, 3, 0 }, { 0, 1, 1, 1, 2, 1, 3, 1 }, { 0, 1, 0, 2, 0, 3, 1, 0 }, { 1, 0, 2, 0, 3, 0, 3, 1 }, { 1, -3, 1, -2, 1, -1, 1, 0 } }; const std::vector<std::vector<int32_t>> N = { { 0, 1, 1, -2, 1, -1, 1, 0 }, { 1, 0, 1, 1, 2, 1, 3, 1 }, { 0, 1, 0, 2, 1, -1, 1, 0 }, { 1, 0, 2, 0, 2, 1, 3, 1 }, { 0, 1, 1, 1, 1, 2, 1, 3 }, { 1, 0, 2, -1, 2, 0, 3, -1 }, { 0, 1, 0, 2, 1, 2, 1, 3 }, { 1, -1, 1, 0, 2, -1, 3, -1 } }; const std::vector<std::vector<int32_t>> P = { { 0, 1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 0, 2, 1, 0, 1, 1 }, { 1, 0, 1, 1, 2, 0, 2, 1 }, { 0, 1, 1, -1, 1, 0, 1, 1 }, { 0, 1, 1, 0, 1, 1, 1, 2 }, { 1, -1, 1, 0, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 1, 1, 2 }, { 0, 1, 1, 0, 1, 1, 2, 0 } }; const std::vector<std::vector<int32_t>> T = { { 0, 1, 0, 2, 1, 1, 2, 1 }, { 1, -2, 1, -1, 1, 0, 2, 0 }, { 1, 0, 2, -1, 2, 0, 2, 1 }, { 1, 0, 1, 1, 1, 2, 2, 0 } }; const std::vector<std::vector<int32_t>> U = { { 0, 1, 0, 2, 1, 0, 1, 2 }, { 0, 1, 1, 1, 2, 0, 2, 1 }, { 0, 2, 1, 0, 1, 1, 1, 2 }, { 0, 1, 1, 0, 2, 0, 2, 1 } }; const std::vector<std::vector<int32_t>> V = { { 1, 0, 2, 0, 2, 1, 2, 2 }, { 0, 1, 0, 2, 1, 0, 2, 0 }, { 1, 0, 2, -2, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 2, 2, 2 } }; const std::vector<std::vector<int32_t>> W = { { 1, 0, 1, 1, 2, 1, 2, 2 }, { 1, -1, 1, 0, 2, -2, 2, -1 }, { 0, 1, 1, 1, 1, 2, 2, 2 }, { 0, 1, 1, -1, 1, 0, 2, -1 } }; const std::vector<std::vector<int32_t>> X = { { 1, -1, 1, 0, 1, 1, 2, 0 } }; const std::vector<std::vector<int32_t>> Y = { { 1, -2, 1, -1, 1, 0, 1, 1 }, { 1, -1, 1, 0, 2, 0, 3, 0 }, { 0, 1, 0, 2, 0, 3, 1, 1 }, { 1, 0, 2, 0, 2, 1, 3, 0 }, { 0, 1, 0, 2, 0, 3, 1, 2 }, { 1, 0, 1, 1, 2, 0, 3, 0 }, { 1, -1, 1, 0, 1, 1, 1, 2 }, { 1, 0, 2, -1, 2, 0, 3, 0 } }; const std::vector<std::vector<int32_t>> Z = { { 0, 1, 1, 0, 2, -1, 2, 0 }, { 1, 0, 1, 1, 1, 2, 2, 2 }, { 0, 1, 1, 1, 2, 1, 2, 2 }, { 1, -2, 1, -1, 1, 0, 2, -2 } }; const int32_t blank_index = 12; const int32_t nRows = 8; const int32_t nCols = 8; std::vector<std::vector<std::vector<int32_t>>> shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z }; std::vector<char> symbols = { 'F', 'I', 'L', 'N', 'P', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '-' }; std::vector<std::vector<int32_t>> grid{nRows, std::vector<int32_t>(nCols, -1)}; std::vector<bool> placed(symbols.size() - 1, false); std::random_device random; std::mt19937 generator(random()); std::uniform_real_distribution<double> distribution(0.0F, 1.0F); void display() { for ( const std::vector<int32_t>& row : grid ) { for ( const int32_t& index : row ) { std::cout << symbols[index] << " "; } std::cout << std::endl; } } void shuffle_shapes() { uint64_t size = shapes.size(); while ( size > 1 ) { int32_t random = static_cast<int32_t>( distribution(generator) * ( size-- ) ); const std::vector<std::vector<int32_t>> temp = shapes[random]; shapes[random] = shapes[size]; shapes[size] = temp; const char temp_symbol = symbols[random]; symbols[random] = symbols[size]; symbols[size] = temp_symbol; } } bool place_orientation(const std::vector<int32_t>& orientation, const int32_t& row, const int32_t& col, const int32_t& shape_index) { for ( uint64_t i = 0; i < orientation.size(); i += 2 ) { int32_t x = col + orientation[i + 1]; int32_t y = row + orientation[i]; if ( x < 0 \|\| x >= nCols \|\| y < 0 \|\| y >= nRows \|\| grid[y][x] != -1 ) { return false; } } grid[row][col] = shape_index; for ( uint64_t i = 0; i < orientation.size(); i += 2 ) { grid[row + orientation[i]][col + orientation[i + 1]] = shape_index; } return true; } void remove_orientation(const std::vector<int32_t>& oorientation, const int32_t& row, const int32_t& col) { grid[row][col] = -1; for ( uint64_t i = 0; i < oorientation.size(); i += 2 ) { grid[row + oorientation[i]][col + oorientation[i + 1]] = -1; } } bool solve(const int32_t& position, const uint64_t& number_placed) { if ( number_placed == shapes.size() ) { return true; } int32_t row = position / nCols; int32_t col = position % nCols; if ( grid[row][col] != -1 ) { return solve(position + 1, number_placed); } for ( uint64_t i = 0; i < shapes.size(); ++i ) { if ( ! placed[i] ) { for ( const std::vector<int32_t>& orientation : shapes[i] ) { if ( ! place_orientation(orientation, row, col, i) ) { continue; } placed[i] = true; if ( solve(position + 1, number_placed + 1) ) { return true; } remove_orientation(orientation, row, col); placed[i] = false; } } } return false; } int main() { shuffle_shapes(); for ( int32_t i = 0; i < 4; ++i ) { int32_t random_row, random_col; do { random_row = static_cast<int32_t>(distribution(generator) * nRows); random_col = static_cast<int32_t>(distribution(generator) * nCols); } while ( grid[random_row][random_col] == blank_index ); grid[random_row][random_col] = blank_index; } if ( solve(0, 0) ) { display(); } else { std::cout << "No solution found" << std::endl; } } </syntaxhighlight> {{ out }} <pre> Y Y Y Y X V V V U Y U X X X - V U U U T X W W V I T T T W W F - I L Z T W F F F I L Z Z Z F P P I L N N Z - P P I L L N N N - P </pre> =={{header\|Go}}== {{trans\|Java}} <~~lang~~syntaxhighlight lang="go">package main import ( Line 398 ⟶ 889: fmt.Println("No solution") } }</~~lang~~syntaxhighlight> {{out}} Line 414 ⟶ 905: =={{header\|Java}}== <~~lang~~syntaxhighlight lang="java">package pentominotiling; import java.util.; Line 567 ⟶ 1,058: static final int[][][] shapes = {F, I, L, N, P, T, U, V, W, X, Y, Z}; }</~~lang~~syntaxhighlight> <pre>F I I I I I L L Line 580 ⟶ 1,071: =={{header\|Julia}}== {{trans\|Zkl}} <~~lang~~syntaxhighlight lang="julia">using Random struct GridPoint x::Int; y::Int end Line 684 ⟶ 1,175: placepentominoes() </~~lang~~syntaxhighlight>{{out}} <pre> Z Z X P P P V Line 698 ⟶ 1,189: =={{header\|Kotlin}}== {{trans\|Java}} <~~lang~~syntaxhighlight lang="scala">// Version 1.1.4-3 import java.util.Random Line 851 ⟶ 1,342: if (solve(0, 0)) printResult() else println("No solution") }</~~lang~~syntaxhighlight> Sample output: Line 868 ⟶ 1,359: {{trans\|Kotlin}} <~~lang~~syntaxhighlight ~~Nim~~lang="nim">import random, sequtils, strutils const Line 995 ⟶ 1,486: var tiling = initTiling() if tiling.solve(0, 0): tiling.printResult else: echo "No solution"</~~lang~~syntaxhighlight> {{out}} Line 1,008 ⟶ 1,499: =={{header\|Perl}}== Generates one tiling at random. To generate more during one run, change the "exit" to "return". <syntaxhighlight lang="perl">use strict; ~~change the "exit" to "return".~~ ~~<lang perl>#!/usr/bin/perl~~ ~~use strict; # first open space version~~ use warnings; use feature 'bitwise'; my $size = shift // 8; Line 1,045 ⟶ 1,534: find( $grid ); # looks for the first open space sub find { Line 1,053 ⟶ 1,543: my ($pattern, $pentomino, $letter) = @$_; local $used{$letter} = 1; $grid =~ /^[^ ]\K$pattern/s and find( $grid ^. "\0" x $-[0] . $pentomino ); } }</~~lang~~syntaxhighlight> {{out}} <pre> Line 1,071 ⟶ 1,561: Apart from the shape table creation, the solving part is a translation of Go.<br> I also added a fast unsolveable() check routine, not that it desperately needed it. <!--<syntaxhighlight lang="phix">(phixonline)--> ~~<lang Phix>constant pentominoes = split("""~~ <span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span> ~~......I................................................................~~ <span style="color: #008080;">constant</span> <span style="color: #000000;">pentominoes</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">split</span><span style="color: #0000FF;">(</span><span style="color: #008000;">""" ~~......I.....L......N.........................................Y.........~~ ...FF...I.....L.....NN....PP....~~TTT~~...........V.....W....X....YY.....ZZ................. FF ......I.....L......N.....PP.....T....U.U.....V....WW...~~XXX~~..............Y.....Z.... .F.FF...I.....LLL....N.NN....PPP....TTT..T....~~UUU~~...~~VVV~~..V.WW....W....X....YY.Y....ZZ..~~.""",'\n')~~ FF....I.....L.....N.....PP.....T....U.U.....V....WW...XXX....Y.....Z... ~~----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- -----~~ .F....I.....LL....N.....P......T....UUU...VVV...WW.....X.....Y....ZZ..."""</span><span style="color: #0000FF;">,</span><span style="color: #008000;">'\n'</span><span style="color: #0000FF;">)</span> <span style="color: #000080;font-style:italic;">----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- </span> ~~function get_shapes()~~ ~~sequence res = {}~~ <span style="color: #008080;">function</span> <span style="color: #000000;">get_shapes</span><span style="color: #0000FF;">()</span> ~~for offset=0 to length(pentominoes[1]) by 6 do~~ <span style="color: #004080;">sequence</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{}</span> -- <span style="color: #008080;">for</span> <span style="color: #000000;">offset</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">pentominoes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">1</span><span style="color: #0000FF;">])</span> <span style="color: #008080;">by</span> <span style="color: #000000;">6</span> <span style="color: #008080;">do</span> ~~-- scan left/right, and up/down, both ways, to give 8 orientations~~ <span style="color: #000080;font-style:italic;">-- ~~-- (computes the equivalent of those hard-coded tables in~~ -- scan left/right, and up/down, both ways, to give 8 orientations ~~-- other examples, albeit in a slightly different order.)~~ -- (computes the equivalent of those hard-coded tables in -- -- other examples, albeit in a slightly different order.) ~~sequence shape = {}~~ ~~integer~~ ~~letter~~--</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">shapes</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{}</span> ~~for orientation=0 to 7 do~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">letter</span> ~~sequence this = {}~~ <span style="color: #008080;">for</span> <span style="color: #000000;">orientation</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span> <span style="color: #008080;">to</span> <span style="color: #000000;">7</span> <span style="color: #008080;">do</span> ~~bool found = false~~ <span style="color: #004080;">sequence</span> <span style="color: #000000;">shape</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{}</span> ~~integer fr, fc~~ <span style="color: #004080;">bool</span> <span style="color: #000000;">found</span> <span style="color: #0000FF;">=</span> <span style="color: #004600;">false</span> ~~for r=1 to 5 do~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">fr</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">fc</span> ~~for c=1 to 5 do~~ <span style="color: #008080;">for</span> <span style="color: #000000;">r</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #000000;">5</span> <span style="color: #008080;">do</span> ~~integer rr = iff(and_bits(orientation,#01)?6-r:r),~~ <span style="color: #008080;">for</span> <span style="color: #000000;">c</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #000000;">5</span> <span style="color: #008080;">do</span> ~~cc = iff(and_bits(orientation,#02)?6-c:c)~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">rr</span> <span style="color: #0000FF;">=</span> <span style="color: #008080;">iff</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">and_bits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">orientation</span><span style="color: #0000FF;">,</span><span style="color: #000000;">#01</span><span style="color: #0000FF;">)?</span><span style="color: #000000;">6</span><span style="color: #0000FF;">-</span><span style="color: #000000;">r</span><span style="color: #0000FF;">:</span><span style="color: #000000;">r</span><span style="color: #0000FF;">),</span> ~~if and_bits(orientation,#04) then {rr,cc} = {cc,rr} end if~~ <span style="color: #000000;">cc</span> <span style="color: #0000FF;">=</span> <span style="color: #008080;">iff</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">and_bits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">orientation</span><span style="color: #0000FF;">,</span><span style="color: #000000;">#02</span><span style="color: #0000FF;">)?</span><span style="color: #000000;">6</span><span style="color: #0000FF;">-</span><span style="color: #000000;">c</span><span style="color: #0000FF;">:</span><span style="color: #000000;">c</span><span style="color: #0000FF;">)</span> ~~integer ch = pentominoes[rr,offset+cc]~~ <span style="color: #008080;">if</span> <span style="color: #7060A8;">and_bits</span><span style="color: #0000FF;">(</span><span style="color: #000000;">orientation</span><span style="color: #0000FF;">,</span><span style="color: #000000;">#04</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">rr</span><span style="color: #0000FF;">,</span><span style="color: #000000;">cc</span><span style="color: #0000FF;">}</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">cc</span><span style="color: #0000FF;">,</span><span style="color: #000000;">rr</span><span style="color: #0000FF;">}</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~if ch!='.' then~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">ch</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">pentominoes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">rr</span><span style="color: #0000FF;">,</span><span style="color: #000000;">offset</span><span style="color: #0000FF;">+</span><span style="color: #000000;">cc</span><span style="color: #0000FF;">]</span> ~~if not found then~~ <span style="color: #008080;">if</span> <span style="color: #000000;">ch</span><span style="color: #0000FF;">!=</span><span style="color: #008000;">'.'</span> <span style="color: #008080;">then</span> ~~{found,fr,fc,letter} = {true,r,c,ch}~~ <span style="color: #008080;">if</span> <span style="color: #008080;">not</span> <span style="color: #000000;">found</span> <span style="color: #008080;">then</span> ~~else~~ <span style="color: #0000FF;">{</span><span style="color: #000000;">found</span><span style="color: #0000FF;">,</span><span style="color: #000000;">fr</span><span style="color: #0000FF;">,</span><span style="color: #000000;">fc</span><span style="color: #0000FF;">,</span><span style="color: #000000;">letter</span><span style="color: #0000FF;">}</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #004600;">true</span><span style="color: #0000FF;">,</span><span style="color: #000000;">r</span><span style="color: #0000FF;">,</span><span style="color: #000000;">c</span><span style="color: #0000FF;">,</span><span style="color: #000000;">ch</span><span style="color: #0000FF;">}</span> ~~this &= {r-fr,c-fc}~~ ~~end~~ if<span style="color: #008080;">else</span> <span style="color: #000000;">shape</span> <span style="color: #0000FF;">&=</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">r</span><span style="color: #0000FF;">-</span><span style="color: #000000;">fr</span><span style="color: #0000FF;">,</span><span style="color: #000000;">c</span><span style="color: #0000FF;">-</span><span style="color: #000000;">fc</span><span style="color: #0000FF;">}</span> ~~end if~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~if not find(this,shape) then~~ <span style="color: #008080;">end</span> ~~shape~~<span style="color: ~~append(shape,this)~~#008080;">for</span> <span style="color: #008080;">if</span> <span style="color: #008080;">not</span> <span style="color: #7060A8;">find</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shape</span><span style="color: #0000FF;">,</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> ~~end if~~ <span style="color: #000000;">shapes</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">append</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">,</span><span style="color: #000000;">shape</span><span style="color: #0000FF;">)</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~res = append(res,{letter&"",shape})~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~end for~~ <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">append</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">letter</span><span style="color: #0000FF;">&</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">})</span> ~~return res~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~end function~~ <span style="color: #008080;">return</span> <span style="color: #000000;">res</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span> ~~constant shapes = get_shapes(),~~ ~~nRows = 8,~~ <span style="color: #008080;">constant</span> <span style="color: #000000;">shapes</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">get_shapes</span><span style="color: #0000FF;">(),</span> ~~nCols = 8~~ <span style="color: #000000;">nRows</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">8</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">nCols</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">8</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">grid</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">repeat</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">repeat</span><span style="color: #0000FF;">(</span><span style="color: #008000;">' '</span><span style="color: #0000FF;">,</span><span style="color: #000000;">nCols</span><span style="color: #0000FF;">),</span><span style="color: #000000;">nRows</span><span style="color: #0000FF;">),</span> <span style="color: #000000;">placed</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">repeat</span><span style="color: #0000FF;">(</span><span style="color: #004600;">false</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">))</span> <span style="color: #008080;">procedure</span> <span style="color: #000000;">re_place</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">o</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">r</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">c</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ch</span><span style="color: #0000FF;">=</span><span style="color: #008000;">' '</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">ch</span> <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">by</span> <span style="color: #000000;">2</span> <span style="color: #008080;">do</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">]]</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">ch</span> <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> <span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span> <span style="color: #008080;">function</span> <span style="color: #000000;">can_place</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">o</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">r</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">c</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ch</span><span style="color: #0000FF;">)</span> ~~sequence grid = repeat(repeat(' ',nCols),nRows),~~ <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">by</span> <span style="color: #000000;">2</span> <span style="color: #008080;">do</span> ~~placed = repeat(false,length(shapes))~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">x</span> <span style="color: #0000FF;">:=</span> <span style="color: #000000;">c</span> <span style="color: #0000FF;">+</span> <span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">],</span> <span style="color: #000000;">y</span> <span style="color: #0000FF;">:=</span> <span style="color: #000000;">r</span> <span style="color: #0000FF;">+</span> <span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]</span> ~~function can_place(sequence o, integer r, c, ch)~~ <span style="color: #008080;">if</span> <span style="color: #000000;">x</span><span style="color: #0000FF;"><</span><span style="color: #000000;">1</span> <span style="color: #008080;">or</span> <span style="color: #000000;">x</span><span style="color: #0000FF;">></span><span style="color: #000000;">nCols</span> ~~for i=1 to length(o) by 2 do~~ <span style="color: #008080;">or</span> <span style="color: #000000;">y</span><span style="color: #0000FF;"><</span><span style="color: #000000;">1</span> <span style="color: #008080;">or</span> <span style="color: #000000;">y</span><span style="color: #0000FF;">></span><span style="color: #000000;">nRows</span> ~~integer x := c + o[i+1],~~ <span style="color: #008080;">or</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">y</span><span style="color: #0000FF;">][</span><span style="color: #000000;">x</span><span style="color: #0000FF;">]!=</span><span style="color: #008000;">' '</span> <span style="color: #008080;">then</span> ~~y := r + o[i]~~ <span style="color: #008080;">return</span> <span style="color: #004600;">false</span> ~~if x<1 or x>nCols~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~or y<1 or y>nRows~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~or grid[y][x]!=' ' then~~ <span style="color: #000000;">re_place</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">,</span><span style="color: #000000;">r</span><span style="color: #0000FF;">,</span><span style="color: #000000;">c</span><span style="color: #0000FF;">,</span><span style="color: #000000;">ch</span><span style="color: #0000FF;">)</span> ~~return false~~ <span style="color: #008080;">return</span> <span style="color: #004600;">true</span> ~~end if~~ <span style="color: #008080;">end</span> <span style="color: #008080;">function</span> ~~end for~~ ~~grid[r][c] = ch~~ <span style="color: #008080;">function</span> <span style="color: #000000;">solve</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">pos</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">numPlaced</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span><span style="color: #0000FF;">)</span> ~~for i=1 to length(o) by 2 do~~ <span style="color: #008080;">if</span> <span style="color: #000000;">numPlaced</span> <span style="color: #0000FF;">==</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> ~~grid[r+o[i]][c+o[i+1]] = ch~~ <span style="color: #008080;">return</span> <span style="color: #004600;">true</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~return true~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">row</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">floor</span><span style="color: #0000FF;">(</span><span style="color: #000000;">pos</span><span style="color: #0000FF;">/</span><span style="color: #000000;">8</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> ~~end function~~ <span style="color: #000000;">col</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">mod</span><span style="color: #0000FF;">(</span><span style="color: #000000;">pos</span><span style="color: #0000FF;">,</span><span style="color: #000000;">8</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">1</span> <span style="color: #008080;">if</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">row</span><span style="color: #0000FF;">][</span><span style="color: #000000;">col</span><span style="color: #0000FF;">]!=</span><span style="color: #008000;">' '</span> <span style="color: #008080;">then</span> ~~procedure un_place(sequence o, integer r, c)~~ <span style="color: #008080;">return</span> <span style="color: #000000;">solve</span><span style="color: #0000FF;">(</span><span style="color: #000000;">pos</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">numPlaced</span><span style="color: #0000FF;">)</span> ~~grid[r][c] = ' '~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~for i=1 to length(o) by 2 do~~ <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> ~~grid[r+o[i]][c+o[i+1]] = ' '~~ <span style="color: #008080;">if</span> <span style="color: #008080;">not</span> <span style="color: #000000;">placed</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]</span> <span style="color: #008080;">then</span> ~~end for~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">ch</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">1</span><span style="color: #0000FF;">][</span><span style="color: #000000;">1</span><span style="color: #0000FF;">]</span> ~~end procedure~~ <span style="color: #008080;">for</span> <span style="color: #000000;">j</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">2</span><span style="color: #0000FF;">])</span> <span style="color: #008080;">do</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">o</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">2</span><span style="color: #0000FF;">][</span><span style="color: #000000;">j</span><span style="color: #0000FF;">]</span> ~~function solve(integer pos=0, numPlaced=0)~~ <span style="color: #008080;">if</span> <span style="color: #000000;">can_place</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">row</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">col</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ch</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> ~~if numPlaced == length(shapes) then~~ <span style="color: #000000;">placed</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #004600;">true</span> ~~return true~~ <span style="color: #008080;">if</span> <span style="color: #000000;">solve</span><span style="color: #0000FF;">(</span><span style="color: #000000;">pos</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">numPlaced</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> ~~end if~~ <span style="color: #008080;">return</span> <span style="color: #004600;">true</span> ~~integer row = floor(pos/8)+1,~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~col = mod(pos,8)+1~~ <span style="color: #000000;">re_place</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">row</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">col</span><span style="color: #0000FF;">)</span> ~~if grid[row][col]!=' ' then~~ <span style="color: #000000;">placed</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #004600;">false</span> ~~return solve(pos+1, numPlaced)~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~end if~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~for i=1 to length(shapes) do~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~if not placed[i] then~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~integer ch = shapes[i][1][1]~~ <span style="color: #008080;">return</span> <span style="color: #004600;">false</span> ~~for j=1 to length(shapes[i][2]) do~~ <span style="color: #008080;">end</span> <span style="color: #008080;">function</span> ~~sequence o = shapes[i][2][j]~~ ~~if can_place(o, row, col, ch) then~~ <span style="color: #008080;">function</span> <span style="color: #000000;">unsolveable</span><span style="color: #0000FF;">()</span> ~~placed[i] = true~~ <span style="color: #000080;font-style:italic;">-- ~~if solve(pos+1, numPlaced+1) then~~ -- The only unsolvable grids seen have ~~return true~~ -- -.- or -..- or -... at edge/corner, ~~end if~~ -- - -- --- ~~un_place(o,~~ ~~row,~~ ~~col)~~ - -- or somewhere in the middle a -.- ~~placed[i] = false~~ -- ~~end~~ if - -- ~~end for~~ -- Simply place all shapes at all positions/orientations, ~~end if~~ -- all the while checking for any untouchable cells. ~~end for~~ --</span> ~~return false~~ <span style="color: #004080;">sequence</span> <span style="color: #000000;">griddled</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">deep_copy</span><span style="color: #0000FF;">(</span><span style="color: #000000;">grid</span><span style="color: #0000FF;">)</span> ~~end function~~ <span style="color: #008080;">for</span> <span style="color: #000000;">r</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #000000;">8</span> <span style="color: #008080;">do</span> <span style="color: #008080;">for</span> <span style="color: #000000;">c</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #000000;">8</span> <span style="color: #008080;">do</span> ~~function unsolveable()~~ <span style="color: #008080;">if</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]=</span><span style="color: #008000;">' '</span> <span style="color: #008080;">then</span> -- <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> ~~-- The only unsolvable grids seen have~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">ch</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">1</span><span style="color: #0000FF;">][</span><span style="color: #000000;">1</span><span style="color: #0000FF;">]</span> ~~-- -.- or -..- or -... at edge/corner,~~ <span style="color: #008080;">for</span> <span style="color: #000000;">j</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">2</span><span style="color: #0000FF;">])</span> <span style="color: #008080;">do</span> ~~-- - -- --- -~~ <span style="color: #004080;">sequence</span> <span style="color: #000000;">o</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">shapes</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">2</span><span style="color: #0000FF;">][</span><span style="color: #000000;">j</span><span style="color: #0000FF;">]</span> ~~-- or somewhere in the middle a -.-~~ <span style="color: #008080;">if</span> <span style="color: #000000;">can_place</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">r</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">c</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ch</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> ~~-- -~~ <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">' '</span> -- <span style="color: #000000;">griddled</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">'-'</span> ~~-- Simply place all shapes at all positions/orientations,~~ <span style="color: #008080;">for</span> <span style="color: #000000;">k</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">o</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">by</span> <span style="color: #000000;">2</span> <span style="color: #008080;">do</span> ~~-- all the while checking for any untouchable cells.~~ <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">k</span><span style="color: #0000FF;">]][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">k</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">]]</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">' '</span> -- <span style="color: #000000;">griddled</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">k</span><span style="color: #0000FF;">]][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">+</span><span style="color: #000000;">o</span><span style="color: #0000FF;">[</span><span style="color: #000000;">k</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">]]</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">'-'</span> ~~sequence griddled = grid~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~for r=1 to 8 do~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~for c=1 to 8 do~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~if grid[r][c]=' ' then~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~for i=1 to length(shapes) do~~ <span style="color: #008080;">if</span> <span style="color: #000000;">griddled</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]!=</span><span style="color: #008000;">'-'</span> <span style="color: #008080;">then</span> <span style="color: #008080;">return</span> <span style="color: #004600;">true</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~integer ch = shapes[i][1][1]~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~for j=1 to length(shapes[i][2]) do~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~sequence o = shapes[i][2][j]~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~if can_place(o, r, c, ch) then~~ <span style="color: #008080;">return</span> <span style="color: #004600;">false</span> ~~grid[r][c] = ' '~~ <span style="color: #008080;">end</span> <span style="color: #008080;">function</span> ~~griddled[r][c] = '-'~~ ~~for k=1 to length(o) by 2 do~~ <span style="color: #008080;">procedure</span> <span style="color: #000000;">add_four_randomly</span><span style="color: #0000FF;">()</span> ~~grid[r+o[k]][c+o[k+1]] = ' '~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">count</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">0</span> ~~griddled[r+o[k]][c+o[k+1]] = '-'~~ <span style="color: #008080;">while</span> <span style="color: #000000;">count</span><span style="color: #0000FF;"><</span><span style="color: #000000;">4</span> <span style="color: #008080;">do</span> ~~end for~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">r</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">rand</span><span style="color: #0000FF;">(</span><span style="color: #000000;">8</span><span style="color: #0000FF;">),</span> ~~end if~~ <span style="color: #000000;">c</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">rand</span><span style="color: #0000FF;">(</span><span style="color: #000000;">8</span><span style="color: #0000FF;">)</span> ~~end for~~ <span style="color: #008080;">if</span> <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]=</span><span style="color: #008000;">' '</span> <span style="color: #008080;">then</span> ~~end for~~ <span style="color: #000000;">grid</span><span style="color: #0000FF;">[</span><span style="color: #000000;">r</span><span style="color: #0000FF;">][</span><span style="color: #000000;">c</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">'-'</span> ~~if griddled[r][c]!='-' then return true end if~~ <span style="color: #000000;">count</span> <span style="color: #0000FF;">+=</span> <span style="color: #000000;">1</span> ~~end if~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">while</span> ~~end for~~ <span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span> ~~return false~~ ~~end function~~ <span style="color: #008080;">procedure</span> <span style="color: #000000;">main</span><span style="color: #0000FF;">()</span> <span style="color: #000000;">add_four_randomly</span><span style="color: #0000FF;">()</span> ~~procedure add_four_randomly()~~ <span style="color: #008080;">if</span> <span style="color: #000000;">unsolveable</span><span style="color: #0000FF;">()</span> <span style="color: #008080;">then</span> ~~integer count = 0~~ <span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"No solution\n"</span><span style="color: #0000FF;">)</span> ~~while count<4 do~~ <span style="color: #008080;">else</span> ~~integer r = rand(8),~~ <span style="color: #008080;">if</span> <span style="color: #008080;">not</span> <span style="color: #000000;">solve</span><span style="color: #0000FF;">()</span> <span style="color: #008080;">then</span> <span style="color: #0000FF;">?</span><span style="color: #000000;">9</span><span style="color: #0000FF;">/</span><span style="color: #000000;">0</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~c = rand(8)~~ <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> ~~if grid[r][c]=' ' then~~ <span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #000000;">grid</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n"</span><span style="color: #0000FF;">)&</span><span style="color: #008000;">"\n"</span><span style="color: #0000FF;">)</span> ~~grid[r][c] = '-'~~ <span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span> ~~count += 1~~ <span style="color: #000000;">main</span><span style="color: #0000FF;">()</span> ~~end if~~ <!--</syntaxhighlight>--> ~~end while~~ ~~end procedure~~ ~~procedure main()~~ ~~add_four_randomly()~~ ~~if unsolveable() then~~ ~~puts(1,"No solution\n")~~ ~~else~~ ~~if not solve() then ?9/0 end if~~ ~~end if~~ ~~puts(1,join(grid,"\n")&"\n")~~ ~~end procedure~~ ~~main()</lang>~~ {{out}} <pre> Line 1,246 ⟶ 1,735: LLLLNNWI </pre> =={{header\|Picat}}== <syntaxhighlight lang="picat"> import sat, util. rotate(Q) = Res => % rotate right by 90 degrees NZ = len(Q[1]), NS = len(Q), Res = new_array(NZ,NS), foreach(Z in 1..NZ, S in 1..NS) Res[Z,S] = Q[S,NZ+1-Z] end. matprint(Q) => NZ = len(Q), NS = len(Q[1]), foreach(Z in 1..NZ, S in 1..NS) printf("%d\|", Q[Z,S]), if S=NS then nl end end, nl. generate(Res) => P0 = [{{1,1,1,1}, % L {1,0,0,0}}, {{0,1,1,1}, % N {1,1,0,0}}, {{1,1,1,1}, % Y {0,1,0,0}}, {{1,1,0}, % F {0,1,1}, {0,1,0}}, {{1,1,1}, % T {0,1,0}, {0,1,0}}, {{0,0,1}, % W {0,1,1}, {1,1,0}}, {{1,1,1}, % P {1,1,0}}, {{0,0,1}, % V {0,0,1}, {1,1,1}}, {{1,0,1}, % U {1,1,1}}, {{1,0,0}, % Z {1,1,1}, {0,0,1}}, {{1,1,1,1,1}}, % I {{0,1,0}, % X {1,1,1}, {0,1,0}}], Np = len(P0), P = [], foreach(I in 1..Np) VarI = [P0[I]], foreach(_ in 1..3) VarI := [rotate(head(VarI))\|VarI] end, P := [VarI\|P] end, Res = P. main => N = 8, M = new_array(N+4,N+4), foreach(R in N+1..N+4, C in 1..N) M[R,C] #= 0 end, foreach(R in 1..N, C in N+1..N+4) M[R,C] #= 0 end, generate(P), % P[1] = X-Pentomino, then P[2] = I, P[3] = Z, and so on U, V, P, X, W, T, F, Y, N, L Np = len(P), M :: 0..Np, foreach(I in 1..Np) count(I, vars(M), 5) end, % 12 pentomino Idx = new_list(Np), % X has 1 rotation variant, I and Z each 2, the rest 4: Idx[1] #= 1, [Idx[2],Idx[3]] :: 1..2, Idx :: 1..4, DZ = new_list(Np), DZ :: 0..N-1, % translation of I.th pentomino DS = new_list(Np), DS :: 0..N-1, foreach(I in 1..Np, J in 1..4) % Constraint only if Idx[I] #= J! NZ = len(P[I,J]), NS = len(P[I,J,1]), foreach(DZI in 0..N-1, DSI in 0..N-1, Z in 1..NZ, S in 1..NS, P[I,J,Z,S]=1) (Idx[I] #= J #/\ DZ[I] #= DZI #/\ DS[I] #= DSI) #=> M[DZI+Z,DSI+S] #= I end end, solve(vars(M) ++ DZ ++ DS ++ Idx), Chr = " XIZUVPWTFYNL", foreach(Z in 1..N) foreach(S in 1..N) printf("%c\|", Chr[1 + M[Z,S]]) end, nl end. </syntaxhighlight> Output: <pre>Y\|Y\|Y\|Y\|P\|P\|Z\|Z\| L\|Y\|X\|P\|P\|P\|Z\|I\| L\|X\|X\|X\|F\|Z\|Z\|I\| L\| \|X\|F\|F\|U\|U\|I\| L\|L\|T\|W\|F\|F\|U\|I\| V\| \|T\|W\|W\|U\|U\|I\| V\|T\|T\|T\|W\|W\|N\|N\| V\|V\|V\| \|N\|N\|N\| \|</pre> =={{header\|Racket}}== {{trans\|Java}} (although purely functional, so no need to undo the tiling attempts) <~~lang~~syntaxhighlight lang="racket">#lang racket (require racket/hash) Line 1,374 ⟶ 1,949: ((0 . 1) (1 . 1) (2 . 1) (2 . 2)) ((1 . -2) (1 . -1) (1 . 0) (2 . -2)))) </syntaxhighlight> ~~</lang>~~ {{out}} Line 1,385 ⟶ 1,960: ZYWWLFF- YYYYLLLL</pre> =={{header\|Python}}== <syntaxhighlight lang="python">from itertools import product minos = (((197123, 7, 6), (1797, 6, 7), (1287, 6, 7), (196867, 7, 6)), ((263937, 6, 6), (197126, 6, 6), (393731, 6, 6), (67332, 6, 6)), ((16843011, 7, 5), (2063, 5, 7), (3841, 5, 7), (271, 5, 7), (3848, 5, 7), (50463234, 7, 5), (50397441, 7, 5), (33686019, 7, 5)), ((131843, 7, 6), (1798, 6, 7), (775, 6, 7), (1795, 6, 7), (1543, 6, 7), (197377, 7, 6), (197378, 7, 6), (66307, 7, 6)), ((132865, 6, 6), (131846, 6, 6), (198146, 6, 6), (132611, 6, 6), (393986, 6, 6), (263938, 6, 6), (67330, 6, 6), (132868, 6, 6)), ((1039, 5, 7), (33751554, 7, 5), (16843521, 7, 5), (16974081, 7, 5), (33686274, 7, 5), (3842, 5, 7), (3844, 5, 7), (527, 5, 7)), ((1804, 5, 7), (33751297, 7, 5), (33686273, 7, 5), (16974338, 7, 5), (16843522, 7, 5), (782, 5, 7), (3079, 5, 7), (3587, 5, 7)), ((263683, 6, 6), (198148, 6, 6), (66310, 6, 6), (393985, 6, 6)), ((67329, 6, 6), (131591, 6, 6), (459266, 6, 6), (263940, 6, 6)), ((459780, 6, 6), (459009, 6, 6), (263175, 6, 6), (65799, 6, 6)), ((4311810305, 8, 4), (31, 4, 8)), ((132866, 6, 6),)) boxchar_double_width = ' ╶╺╵└┕╹┖┗╴─╼┘┴┶┚┸┺╸╾━┙┵┷┛┹┻╷┌┍│├┝╿┞┡┐┬┮┤┼┾┦╀╄┑┭┯┥┽┿┩╃╇╻┎┏╽┟┢┃┠┣┒┰┲┧╁╆┨╂╊┓┱┳┪╅╈┫╉╋' boxchar_single_width = [c + ' ─━'[i%3] for i, c in enumerate(boxchar_double_width)] # choose drawing alphabet based on terminal font patterns = boxchar_single_width tiles = [] for row in reversed(minos): tiles.append([]) for n, x, y in row: for shift in (b8 + a for a, b in product(range(x), range(y))): tiles[-1].append(n << shift) def img(seq): b = [[0]10 for _ in range(10)] for i, s in enumerate(seq): for j, k in product(range(8), range(8)): if s & (1<<(j8 + k)): b[j + 1][k + 1] = i + 1 idices = [[0]9 for _ in range(9)] for i, j in product(range(9), range(9)): n = (b[i+1][j+1], b[i][j+1], b[i][j], b[i+1][j], b[i+1][j+1]) idices[i][j] = sum((a != b)(1 + (not a or not b))3**i for i, (a,b) in enumerate(zip(n, n[1:]))) return '\n'.join(''.join(patterns[i] for i in row) for row in idices) def tile(board=0, seq=tuple(), tiles=tiles): if not tiles: yield img(seq) return for c in tiles[0]: b = board \| c tnext = [] # not using list comprehension ... for t in tiles[1:]: tnext.append(tuple(n for n in t if not n&b)) if not tnext[-1]: break # because early break is faster else: yield from tile(b, seq + (c,), tnext) for x in tile(): print(x)</syntaxhighlight> {{out}} <pre> ┏━┯━━━┯━━━━━━━┓ ┏━┛ └─┐ └─┬─┐ ┌─┨ ┠─┐ ┌─╆━┓ │ └─┘ ┃ ┃ ├─┤ ┗━┹─╆━┱───┨ ┃ │ └───┐ ┡━┹─┐ ┃ ┃ │ ┌─┬─┴─┘ ┌─┤ ┃ ┃ ┢━┪ ├───┬─┘ │ ┃ ┠─┺━┛ │ └─┐ └─┨ ┗━━━━━┷━━━━━┷━━━┛ ┏━┯━━━┓ ┏━┯━━━┓ ┏━┛ └─┐ ┗━┩ └─┐ ┃ ┠─┐ ┌─╆━┓ │ ┌─┘ ┃ ┃ ├─┤ ┗━┹─┤ ├───┨ ┃ │ └───┐ ├─┴─┐ ┃ ┃ │ ┌─┬─┴─┘ ┌─┤ ┃ ┃ ┢━┪ ├───┬─┘ │ ┃ ┠─┺━┛ │ └─┐ └─┨ ┗━━━━━┷━━━━━┷━━━┛ (goes on and on) </pre> =={{header\|Raku}}== {{trans\|Java}} <syntaxhighlight lang="raku" ~~perl6~~line># 20201028 Raku programming solution my \F = [ <1 -1 1 0 1 1 2 1>, <0 1 1 -1 1 0 2 0>, <1 0 1 1 1 2 2 1>, Line 1,513 ⟶ 2,172: } PrintResult() if solve 0,0</~~lang~~syntaxhighlight> {{out}} <pre>F F Ⓡ I I I I I Line 1,523 ⟶ 2,182: V Z Z Z W W Y T V V V Z Y Y Y Y</pre> ~~=={{header\|Visual Basic .NET}}==~~ ~~{{trans\|Java}}via{{trans\|C#}}~~ Instead of having a large declaration for each rotation of each pentomino, a small array of encoded positions is supplied '''(seeds)''', and it is expanded into the set of 63 possible orientations. However, the additional expansion routines code does take up about 2/3 of the space that would have been taken by the elaborate Integer array definitions. ~~<lang vbnet>Module Module1~~ ~~Dim symbols As Char() = "XYPFTVNLUZWI█".ToCharArray(),~~ ~~nRows As Integer = 8, nCols As Integer = 8,~~ ~~target As Integer = 12, blank As Integer = 12,~~ ~~grid As Integer()() = New Integer(nRows - 1)() {},~~ ~~placed As Boolean() = New Boolean(target - 1) {},~~ ~~pens As List(Of List(Of Integer())), rand As Random,~~ ~~seeds As Integer() = {291, 292, 293, 295, 297, 329, 330, 332, 333, 335, 378, 586}~~ ~~Sub Main()~~ ~~Unpack(seeds) : rand = New Random() : ShuffleShapes(2)~~ ~~For r As Integer = 0 To nRows - 1~~ ~~grid(r) = Enumerable.Repeat(-1, nCols).ToArray() : Next~~ ~~For i As Integer = 0 To 3~~ ~~Dim rRow, rCol As Integer : Do : rRow = rand.Next(nRows) : rCol = rand.Next(nCols)~~ ~~Loop While grid(rRow)(rCol) = blank : grid(rRow)(rCol) = blank~~ ~~Next~~ ~~If Solve(0, 0) Then~~ ~~PrintResult()~~ ~~Else~~ ~~Console.WriteLine("no solution for this configuration:") : PrintResult()~~ ~~End If~~ ~~If System.Diagnostics.Debugger.IsAttached Then Console.ReadKey()~~ ~~End Sub~~ ~~Sub ShuffleShapes(count As Integer) ' changes order of the pieces for a more random solution~~ ~~For i As Integer = 0 To count : For j = 0 To pens.Count - 1~~ ~~Dim r As Integer : Do : r = rand.Next(pens.Count) : Loop Until r <> j~~ ~~Dim tmp As List(Of Integer()) = pens(r) : pens(r) = pens(j) : pens(j) = tmp~~ ~~Dim ch As Char = symbols(r) : symbols(r) = symbols(j) : symbols(j) = ch~~ ~~Next : Next~~ ~~End Sub~~ ~~Sub PrintResult() ' display results~~ ~~For Each r As Integer() In grid : For Each i As Integer In r~~ ~~Console.Write("{0} ", If(i < 0, ".", symbols(i)))~~ ~~Next : Console.WriteLine() : Next~~ ~~End Sub~~ ~~' returns first found solution only~~ ~~Function Solve(ByVal pos As Integer, ByVal numPlaced As Integer) As Boolean~~ ~~If numPlaced = target Then Return True~~ ~~Dim row As Integer = pos \ nCols, col As Integer = pos Mod nCols~~ ~~If grid(row)(col) <> -1 Then Return Solve(pos + 1, numPlaced)~~ ~~For i As Integer = 0 To pens.Count - 1 : If Not placed(i) Then~~ ~~For Each orientation As Integer() In pens(i)~~ ~~If Not TPO(orientation, row, col, i) Then Continue For~~ ~~placed(i) = True : If Solve(pos + 1, numPlaced + 1) Then Return True~~ ~~RmvO(orientation, row, col) : placed(i) = False~~ ~~Next : End If : Next : Return False~~ ~~End Function~~ ~~' removes a placed orientation~~ ~~Sub RmvO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer)~~ ~~grid(row)(col) = -1 : For i As Integer = 0 To ori.Length - 1 Step 2~~ ~~grid(row + ori(i))(col + ori(i + 1)) = -1 : Next~~ ~~End Sub~~ ~~' checks an orientation, if possible it is placed, else returns false~~ ~~Function TPO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer,~~ ~~ByVal sIdx As Integer) As Boolean~~ ~~For i As Integer = 0 To ori.Length - 1 Step 2~~ ~~Dim x As Integer = col + ori(i + 1), y As Integer = row + ori(i)~~ ~~If x < 0 OrElse x >= nCols OrElse y < 0 OrElse y >= nRows OrElse~~ ~~grid(y)(x) <> -1 Then Return False~~ ~~Next : grid(row)(col) = sIdx~~ ~~For i As Integer = 0 To ori.Length - 1 Step 2~~ ~~grid(row + ori(i))(col + ori(i + 1)) = sIdx~~ ~~Next : Return True~~ ~~End Function~~ ~~'!' the following routines expand the seed values into the 63 orientation arrays.~~ ~~' source code space savings comparison:~~ ~~' around 2000 chars for the expansion code, verses about 3000 chars for the integer array defs.~~ ~~' perhaps not worth the savings?~~ ~~Sub Unpack(sv As Integer()) ' unpacks a list of seed values into a set of 63 rotated pentominoes~~ ~~pens = New List(Of List(Of Integer())) : For Each item In sv~~ ~~Dim Gen As New List(Of Integer()), exi As List(Of Integer) = Expand(item),~~ ~~fx As Integer() = ToP(exi) : Gen.Add(fx) : For i As Integer = 1 To 7~~ ~~If i = 4 Then Mir(exi) Else Rot(exi)~~ ~~fx = ToP(exi) : If Not Gen.Exists(Function(Red) TheSame(Red, fx)) Then Gen.Add(ToP(exi))~~ ~~Next : pens.Add(Gen) : Next~~ ~~End Sub~~ ~~' expands an integer into a set of directions~~ ~~Function Expand(i As Integer) As List(Of Integer)~~ ~~Expand = {0}.ToList() : For j As Integer = 0 To 3 : Expand.Insert(1, i And 15) : i >>= 4 : Next~~ ~~End Function~~ ~~' converts a set of directions to an array of y, x pairs~~ ~~Function ToP(p As List(Of Integer)) As Integer()~~ ~~Dim tmp As List(Of Integer) = {0}.ToList() : For Each item As Integer In p.Skip(1)~~ ~~tmp.Add(tmp.Item(item >> 2) + {1, 8, -1, -8}(item And 3)) : Next~~ ~~tmp.Sort() : For i As Integer = tmp.Count - 1 To 0 Step -1 : tmp.Item(i) -= tmp.Item(0) : Next~~ ~~Dim res As New List(Of Integer) : For Each item In tmp.Skip(1)~~ ~~Dim adj = If((item And 7) > 4, 8, 0)~~ ~~res.Add((adj + item) \ 8) : res.Add((item And 7) - adj)~~ ~~Next : Return res.ToArray()~~ ~~End Function~~ ~~' compares integer arrays for equivalency~~ ~~Function TheSame(a As Integer(), b As Integer()) As Boolean~~ ~~For i As Integer = 0 To a.Count - 1 : If a(i) <> b(i) Then Return False~~ ~~Next : Return True~~ ~~End Function~~ ~~Sub Rot(ByRef p As List(Of Integer)) ' rotates a set of directions by 90 degrees~~ ~~For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or ((p(i) + 1) And 3) : Next~~ ~~End Sub~~ ~~Sub Mir(ByRef p As List(Of Integer)) ' mirrors a set of directions~~ ~~For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or (((p(i) Xor 1) + 1) And 3) : Next~~ ~~End Sub~~ ~~End Module~~ ~~</lang>~~ ~~{{out}}~~ ~~Solution found result ''(typical output)'':~~ ~~<pre>Y F F █ L L L L~~ ~~Y Y F F L P P P~~ ~~Y T F N N N P P~~ ~~Y T N N █ V V V~~ ~~T T T W W Z Z V~~ ~~U U X █ W W Z V~~ ~~U X X X █ W Z Z~~ ~~U U X I I I I I </pre>~~ ~~Impossible to solve result ''(a somewhat rare occurrence)'':~~ ~~<pre>no solution for this configuration:~~ ~~. █ . . . . . .~~ ~~█ . . █ . . . .~~ ~~. . . . . . . .~~ ~~. . . . █ . . .~~ ~~. . . . . . . .~~ ~~. . . . . . . .~~ ~~. . . . . . . .~~ ~~. . . . . . . . </pre>~~ ~~===VB .NET alternative output ''(corner characters)''===~~ ~~This output may appear better in a command window~~ [https://tio.run/##rRlLc9u4@e5fgeoQExNKI8nOxvHE7iS20/HUSTySs952eoEoSIJDEVyAlKXNZKbTcw896LCHPfbY4x731@iPpN8H8AWKspN2lRnSBPC938hi1A6k4l@@vJXjNOTEvnp7ZI/A71zMiV7NRzLU5JUmZzOmPEpOSOuHv1y/ufn@3dWHv95etludG4lbr5RiK4/6BhR/0UDeG8DLKOFTrgDyyCfRWYauulrAJExNeeJu9/o@GYUs@ri1XIBNlRhXdj1q@HzH74sVy0yb9HDr0@cSNA5ZwA3waylDzqICNP/OeEJYF5JHRpAroRPv/aR4F0xQ6hPFIoN8AG85L4E152PtsAxUP/Vf9HzSf9HHxwE@nuHjuU8O@i/gcdDFRx8fB/iA3YPnoNNnR999zmw2TEfkLRMgRUHqQxSz4KNnKFJybFmyIlquPFwdztLJJOTDGYu59vol@BupiHJV3yU3khQaLU7mlvAUCnMRpXOu2CjknQGPOUu8di8zPwWXydwFKL/jy8ShJhqoHThU0DMV0Af9Ar7q8WNyLlFG2ARQFLWD@K39jfQI4OwYjhz0V1LG5HYmICKsPABMPYREwawvHu/cKlA5gl1OyFCGC@6BDbuU3Mx45NC8ViJKBlynYVKx3UWouXPsTEYa3LJzq0TCr0TEvVYkCSyliZARmYD6kpnQJJDRRExTxXD5uIWS76AAznA5cdhc6YTPO@eCTSOpExHozjkfpVNQb@dSv0oSFswgYlCCgp0BZ@M/81WGF3GCI1Zc0vWuQKZRNcgp2SfBjEVTrolUYzCjnIAYnMSCB7CGUjEyh0xl7CbnhcCP@o0ldWz27/JFjNzOmdmp@2/hXU1O5fhNiQSVa1zmQ5SIEI69PCV3jViTeVzNGGWmAMyIDyPnuPgrW7sr1u5wDXA04g5meZKGQ1natvgqH@XOXXXHIA5mDl4Ushqd20Z1HApMOBYasumKTFgUrIgyG3rP0So3OW@YAOQUSNo/OhfzOFk5prwAH3NsAAQuI5vnj8sTjsVhX21pBik@KQgB4BwSUetT93PLB1/3BHlJICBbHfjMlSEgcTdpIkPVgn9PyGJ0NannLic2vTOpIq742Du/9QA0R@qqcR@wJqmCQjIRSifg6SnsF@Eso9Dq5U0aBWbF5pDXq@9ZSGJZrSA@sauQdq@LmlYEWFnfqqFenj3JS68J64FhityolLv2g6zqxBiy8Deb1H2ItXB7F1oKu1@la1MnZs4AEyfES7vnULZiIvxTglUj55M@GvBubIOJgNw7mWR1Hoy7nXodp5NK8CgxaXPL/UwQCroFnEmFZG6u33sVFD6qzGjGJxlpdJNERClHmo2oSlZPjAmsELtUgp90t9mqv8F8sYM7k2IqZN@weuGpBIItGZn3wysjW8LggdxjK44@lwsIIZa3XBVGipRiOLR@DNuOAXL/dn0wX3V9j@65/UjhaSfoaMc7nQdodq54NE1mxnmGCY9Jv6G/ARae4mHMFYg4/zK2KKjsSJ1Y63jwETQREccYYoIRowW0TEQkBKq41ZRPOGi2zBSFnousgF73/2vN33Yae0xfjpePZZP/XaWYWJYuZF2lPlm5B6oW2KuF4RJzOnmvsHeCj9OTbObIVlbV7ZXZNp2sXdlSgTH4inrLpjTlhkkWDlsuh@r7HfT0la7nUHMjtEgMTQH6h33Tck1kGMp7LM9KQhGKIGL5MsaRAXdxiCALFqawDMVfmsXvDpysybCz153M12HUkakKONh0DPAwisCTLYAANqnzmCmhoUMtTsOPKVMF@91uF9tCpbO2lltONBJBbD5ZcKUxpYyAVXKwfV5kOjYskTGfVNiKuYJuVJMIsva9VKB3I6Bl7Y@VNiefnxZOYGHDk5odTGkhdHTYtG7ph8GS2QElKQkagn0oI4mci0hy7Q6Tdih7YJ50eh9o0rEo6cVWNP2Jm9pVRVYigWyyFA1dqJnZjKU9RE23s8FkWR9Yb@S1B9iQL6DZeTUee5MlbU6wPfTy53sNdVPA7qGNq7dCWYQmOgcyMV9NnDjEs@KLPFwsQSzt5d7tDaBpQNxDNuf44QMwzeplznOOqbHtMw0FnoLT9KGsbsPEpPXc71wXGAvFDVPazd651usptm6gcmazAXlCoI@FUdqco8WQ0zA8Y9E2MJ3LSHOVeNBAADnA0XuGgIKcnqINatJt1XCYKiHkEt0kE0FRs@jHnZUPyTdm0NbWahUou2kKotTxrr3H5ybarIEyOtzhIO4MP4rY67lWBtTGuvi@BCDj/KAO0qeQUj@Boo58gjcX7aPPdg/VdkC3bi4QwRDyiLfD/3G/7EvBKl2b5E2rUFKnpH1Sfna3yFTGqIb4bswQhrMG0REVG@NUDJNQKdtzSk7JoZG76wIAXaMrD6GeGvwU2v8jaqcju1fF00b8dEc1QojiHughn8MiYfNpmcxtjuc/pgKyLYd5s@ZkWcCzWjM0quXwb2hkWH2qYGgs6AlG@VDxYFfwFSXYNMCQ8l6vBhxaweYY2c/KSHMMjlbkRRcK3VTxSnHZOSs5IsW29ffMGw3YPqTQFRHPrpgxw/r@w9cCmMMfEWEulJJK70yNvwfTdukHwNL7SuaxBSqaHnQve5EBK3GauP4FM33lJoNWLjX2yVim2MFzyJQr04@wIDG1gGh7hC8DHifQM0R8gpeyZWzf1u5EqtFcud/Bqo@XUrd4HwHrTzCA4X1iriV80mrBUDejX5/OLcvtezGGNojpQAiSoNtm9SvIrjJMv5WPa4UuiouOZo04mQtl1h51LoF0ZxiHIvGQd/rt10U5Wuckpkb74bUIaMPS7dK8xbZDRcj04zfPBrTSmjsZETHAQUP/2L7yGyJLUtDy5ug6/emnkHsIYzmi2UVS841xmSbhWA4LUH6zdJ0rhkWwKuEDWRUSCNidmzIB8kIbbY0J9h5z@J6jKNgQg@0xNDMfyC7JXAfIeGOlBbJEm/nCt9sUsqvHckkgw2Z/Zml2hMqs64CVJiqON@N7WcfHmvCNSnxsC9/uGlEA9fcariFbpNffrNeHm/XPm/XfN@tfjzbrf2zW/9ysf9ms/7VZ/3uz/s9m/VvLg3hmNrOxYgTu@iaT1cZdb5QdqJ81/UuJB6uUWT/M1kfFeglzROljvtjkUvhp/@vwy5f/Ag Try it online!] ~~{{out}}~~ ~~Solution found result ''(typical output)'':~~ ~~<pre>┌─────┬─────┬─┬─┐~~ ~~│ ┌─┐ ├─┐ │ │ │~~ ~~├─┼─┴─┴─┴─┬─┘ │ │~~ ~~│ └───┬─┐ │ ┌─┤ │~~ ~~│ ┌───┼─┼─┴─┘ │ │~~ ~~├─┘ ┌─┘ └─┐ ┌─┼─┤~~ ~~│ ┌─┼─┐ ┌─┴─┘ │ │~~ ~~├─┴─┘ └─┤ ┌───┘ │~~ ~~└───────┴─┴─────┘</pre>~~ ~~Impossible to solve result ''(a somewhat rare occurrence)'':~~ ~~<pre>no solution for this configuration:~~ ~~┌─┬─┬─┬─┬───────┐~~ ~~│ └─┘ └─┘ │~~ ~~│ ┌─┐ │~~ ~~├─┼─┘ │~~ ~~├─┘ │~~ ~~│ │~~ ~~│ │~~ ~~│ │~~ ~~└───────────────┘</pre>~~ =={{header\|Wren}}== {{trans\|Kotlin}} {{libheader\|Wren-~~trait~~iterate}} <~~lang~~syntaxhighlight ~~ecmascript~~lang="wren">import "random" for Random import "./~~trait~~iterate" for Stepped var F = [ Line 1,846 ⟶ 2,337: grid[randRow][randCol] = blank } if (solve.call(0, 0)) printResult.call() else System.print("No solution")</~~lang~~syntaxhighlight> {{out}} Line 1,863 ⟶ 2,354: =={{header\|zkl}}== {{trans\|Java}} <~~lang~~syntaxhighlight lang="zkl">fcn printResult { foreach row in (grid){ row.apply(symbols.get).concat(" ").println() } } fcn tryPlaceOrientation(o, R,C, shapeIndex){ Line 1,892 ⟶ 2,383: } False }</~~lang~~syntaxhighlight> <~~lang~~syntaxhighlight lang="zkl">reg [private] // the shapes are made of groups of 4 (r,c) pairs _F=T(T(1,-1, 1,0, 1,1, 2,1), T(0,1, 1,-1, 1,0, 2,0), T(1,0 , 1,1, 1,2, 2,1), T(1,0, 1,1, 2,-1, 2,0), T(1,-2, 1,-1, 1,0, 2,-1), Line 1,929 ⟶ 2,420: symbols="FILNPTUVWXYZ-".split(""), shapes=T(_F,_I,_L,_N,_P,_T,_U,_V,_W,_X,_Y,_Z) // ((a,b, c,d))-->(((a,b),(c,d))) .pump(List,List("pump",List,List("pump",List,Void.Read,T.create)));</~~lang~~syntaxhighlight> <~~lang~~syntaxhighlight lang="zkl">foreach r,c in ([0..nRows-1].walk().shuffle().zip([0..nCols-1].walk().shuffle())[0,4]) { grid[r][c]=blank } // make sure 4 unique random spots if(solve(0,0)) printResult(); else println("No solution");</~~lang~~syntaxhighlight> {{out}} <pre>