Solve triangle solitaire puzzle: Difference between revisions

Line 34:

<~~lang~~ 11l>F DrawBoard(board)

<syntaxhighlight lang="11l">F DrawBoard(board)

V peg = [‘’] * 16

L(n) 1.<16

Line 112:

AddPeg(&board, land)

DrawBoard(board)

print("Peg #. jumped over #. to land on #.\n".format(hex(peg), hex(over), hex(land)))</~~lang~~>

print("Peg #. jumped over #. to land on #.\n".format(hex(peg), hex(over), hex(land)))</syntaxhighlight>

Line 211:

=={{header|D}}==

<~~lang~~ d>import std.stdio, std.array, std.string, std.range, std.algorithm;

<syntaxhighlight lang="d">import std.stdio, std.array, std.string, std.range, std.algorithm;

immutable N = [0,1,1,1,1,1,1,1,1,1,1,1,1,1,1];

Line 263:

}

writeln(l.empty ? "No solution found." : l);

}</~~lang~~>

}</syntaxhighlight>

<pre>

Line 365:

=={{header|EasyLang}}==

<lang>brd$[] = strchars "

<syntaxhighlight lang="text">brd$[] = strchars "

┏━━━━━━━━━┓

┃ · ┃

Line 401:

call solve solution$

print solution$

</syntaxhighlight>

</lang>

=={{header|Elixir}}==

Inspired by Ruby

<~~lang~~ elixir>defmodule IQ_Puzzle do

<syntaxhighlight lang="elixir">defmodule IQ_Puzzle do

def task(i \\ 0, n \\ 5) do

fmt = Enum.map_join(1..n, fn i ->

Line 447:

end

IQ_Puzzle.task</~~lang~~>

IQ_Puzzle.task</syntaxhighlight>

Line 552:

=={{header|Go}}==

<~~lang~~ go>package main

<syntaxhighlight lang="go">package main

import "fmt"

Line 666:

fmt.Printf("Peg %X jumped over %X to land on %X\n\n", peg, over, land)

}

}</~~lang~~>

}</syntaxhighlight>

Line 674:

=={{header|J}}==

NB. This is a direct translation of the python program,

NB. except for the display which by move is horizontal.

Line 856:

NB. Solution NB. return Solution however Solution is global.

)

</syntaxhighlight>

</lang>

Example linux session with program in file CrackerBarrel.ijs

<pre>

Line 895:

Print one possible solution.

import java.util.ArrayList;

import java.util.Arrays;

Line 1,083:

}

</syntaxhighlight>

</lang>

<pre>

Line 1,121:

=={{header|Julia}}==

<~~lang~~ julia>moves = [[1, 2, 4], [1, 3, 6], [2, 4, 7], [2, 5, 9], [3, 5, 8], [3, 6, 10], [4, 5, 6],

<syntaxhighlight lang="julia">moves = [[1, 2, 4], [1, 3, 6], [2, 4, 7], [2, 5, 9], [3, 5, 8], [3, 6, 10], [4, 5, 6],

[4, 7, 11], [4, 8, 13], [5, 8, 12], [5, 9, 14], [6, 9, 13], [6, 10, 15],

[7, 8, 9], [8, 9, 10], [11, 12, 13], [12, 13, 14], [13, 14, 15]]

Line 1,157:

end

</~~lang~~>{{out}}

</syntaxhighlight>{{out}}

<pre>

Starting board:

Line 1,260:

=={{header|Kotlin}}==

<~~lang~~ scala>// version 1.1.3

<syntaxhighlight lang="scala">// version 1.1.3

data class Solution(val peg: Int, val over: Int, val land: Int)

Line 1,335:

println("Peg %X jumped over %X to land on %X\n".format(peg, over, land))

}

}</~~lang~~>

}</syntaxhighlight>

Line 1,439:

=={{header|Mathematica}}/{{header|Wolfram Language}}==

<~~lang~~ ~~Mathematica~~>ClearAll[Showstate]

<syntaxhighlight lang="mathematica">ClearAll[Showstate]

Showstate[state_List, pos_] := Module[{p, e},

p = {#, FirstPosition[pos, #, Missing[], {2}]} & /@ state;

Line 1,484:

state = DeleteCases[Range[15], x];

continue = True;

SolvePuzzle[{state, {}}, {y}]</~~lang~~>

SolvePuzzle[{state, {}}, {y}]</syntaxhighlight>

Outputs a graphical overview, by clicking one can go through the different states.

Line 1,490:

=={{header|Nim}}==

<~~lang~~ ~~Nim~~>import sequtils, strutils

<syntaxhighlight lang="nim">import sequtils, strutils

type

Line 1,565:

board[land] = true

board.draw()

echo "Peg $1 jumped over $2 to land on $3\n".format(peg.toHex(1), over.toHex(1), land.toHex(1))</~~lang~~>

echo "Peg $1 jumped over $2 to land on $3\n".format(peg.toHex(1), over.toHex(1), land.toHex(1))</syntaxhighlight>

Line 1,668:

=={{header|Perl}}==

<~~lang~~ perl>@start = qw<

<syntaxhighlight lang="perl">@start = qw<

0

1 1

Line 1,719:

print $result ? $result : "No solution found";

</syntaxhighlight>

</lang>

<pre style="height:60ex;overflow:scroll;">Starting with

Line 1,839:

Twee brute-force string-based solution. Backtracks a mere 366 times, whereas starting with the 5th peg missing backtracks 19388 times (all in 0s, obvs).

-- demo\rosetta\IQpuzzle.exw

constant moves = {-11,-9,2,11,9,-2}

Line 1,869:

"""

puts(1,substitute(join_by(split(start&solve(start,14),'\n'),5,7),"-"," "))

Line 1,887:

Adapted to the English game (also in demo\rosetta\IQpuzzle.exw):

constant moves = {-2,15,2,-15}

function solve(string board, integer left)

Line 1,922:

"""

puts(1,substitute(join_by(split(start&solve(start,32),'\n'),7,8),"-"," "))

Line 1,961:

=={{header|Picat}}==

This version use the constraint solver (cp).

<~~lang~~ ~~Picat~~>import cp.

<syntaxhighlight lang="picat">import cp.

go =>

Line 2,089:

printf(" %2d %2d %2d %2d\n",B[7],B[8],B[9],B[10]),

printf(" %2d %2d %2d %2d %2d\n",B[11],B[12],B[13],B[14],B[15]),

nl.</~~lang~~>

nl.</syntaxhighlight>

Line 2,251:

Works with SWI-Prolog and module(lambda).

<~~lang~~ ~~Prolog~~>:- use_module(library(lambda)).

<syntaxhighlight lang="prolog">:- use_module(library(lambda)).

iq_puzzle :-

Line 2,347:

select(End, Free, F1),

display(Tail, [Start, Middle | F1]).

</syntaxhighlight>

</lang>

Output :

<pre> ?- iq_puzzle.

Line 2,469:

=={{header|Python}}==

<syntaxhighlight lang="python">#

<lang Python>#

# Draw board triangle in ascii

#

Line 2,564:

AddPeg(board,land) # board order changes!

DrawBoard(board)

print "Peg %X jumped over %X to land on %X\n" % (peg,over,land)</~~lang~~>

print "Peg %X jumped over %X to land on %X\n" % (peg,over,land)</syntaxhighlight>

Line 2,669:

Oh and there are some useful triangle numbers functions thrown in for free!

<~~lang~~ racket>#lang racket

<syntaxhighlight lang="racket">#lang racket

(define << arithmetic-shift)

(define bwbs? bitwise-bit-set?)

Line 2,747:

;; Solve #1 missing -> #13 left alone

(for-each display-board (find-path (flip-peg 1 full-board) (flip-peg 13 empty-board)))</~~lang~~>

(for-each display-board (find-path (flip-peg 1 full-board) (flip-peg 13 empty-board)))</syntaxhighlight>

Line 2,834:

constant @start = <

0

Line 2,884:

last if $result

};

say $result ?? $result !! "No solution found";</~~lang~~>

say $result ?? $result !! "No solution found";</syntaxhighlight>

<pre style="height:60ex;overflow:scroll;">Starting with

Line 2,988:

=={{header|Ruby}}==

<~~lang~~ ruby># Solitaire Like Puzzle Solver - Nigel Galloway: October 18th., 2014

<syntaxhighlight lang="ruby"># Solitaire Like Puzzle Solver - Nigel Galloway: October 18th., 2014

G = [[0,1,3],[0,2,5],[1,3,6],[1,4,8],[2,4,7],[2,5,9],[3,4,5],[3,6,10],[3,7,12],[4,7,11],[4,8,13],[5,8,12],[5,9,14],[6,7,8],[7,8,9],[10,11,12],[11,12,13],[12,13,14],

[3,1,0],[5,2,0],[6,3,1],[8,4,1],[7,4,2],[9,5,2],[5,4,3],[10,6,3],[12,7,3],[11,7,4],[13,8,4],[12,8,5],[14,9,5],[8,7,6],[9,8,7],[12,11,10],[13,12,11],[14,13,12]]

Line 3,002:

l=false; G.each{|g| l=solve(N,N.inject(:+),g); break if l}

puts l ? l : "No solution found"

</syntaxhighlight>

</lang>

Line 3,107:

=={{header|Sidef}}==

<~~lang~~ ruby>const N = [0,1,1,1,1,1,1,1,1,1,1,1,1,1,1]

<syntaxhighlight lang="ruby">const N = [0,1,1,1,1,1,1,1,1,1,1,1,1,1,1]

const G = [

Line 3,146:

var r = ''

G.each {|g| (r = solve(N, 1, g)) && break }

say (r ? r : "No solution found")</~~lang~~>

say (r ? r : "No solution found")</syntaxhighlight>

Line 3,253:

'''Notes:'''

This program uses a brute-force method with a string of 25 characters to internally represent the 15 spots on the peg board. One can set the starting removed peg and intended last remaining peg by editing the header variable declarations named '''''Starting''''' and '''''Target'''''. If one doesn't care which spot the last peg lands on, the '''''Target''''' variable can be set to 0. The constant '''''n''''' can be changed for different sized peg boards, for example with '''''n = 6''''' the peg board would have 21 positions.

<~~lang~~ vbnet>

Imports System, Microsoft.VisualBasic.DateAndTime

Line 3,379:

If Diagnostics.Debugger.IsAttached Then Console.ReadLine()

End Sub

End Module</~~lang~~>

End Module</syntaxhighlight>

'''A full solution:'''

Line 3,485:

<~~lang~~ ecmascript>import "/fmt" for Conv, Fmt

<syntaxhighlight lang="ecmascript">import "/fmt" for Conv, Fmt

var board = List.filled(16, true)

Line 3,564:

drawBoard.call()

Fmt.print("Peg $X jumped over $X to land on $X\n", peg, over, land)

}</~~lang~~>

}</syntaxhighlight>

Line 3,573:

=={{header|Yabasic}}==

<~~lang~~ ~~Yabasic~~>// Rosetta Code problem: http://rosettacode.org/wiki/Solve_triangle_solitare_puzzle

<syntaxhighlight lang="yabasic">// Rosetta Code problem: http://rosettacode.org/wiki/Solve_triangle_solitare_puzzle

// by Galileo, 04/2022

Line 3,601:

start$ = "\n\n 0 \n 1 1 \n 1 1 1 \n 1 1 1 1 \n1 1 1 1 1"

print start$, solve$(start$, 14)</~~lang~~>

print start$, solve$(start$, 14)</syntaxhighlight>

<pre>

Line 3,693:

<~~lang~~ zkl>var N=T(0,1,1,1,1,1,1,1,1,1,1,1,1,1,1);

<syntaxhighlight lang="zkl">var N=T(0,1,1,1,1,1,1,1,1,1,1,1,1,1,1);

var G=T( T(0,1, 3), T(0,2, 5), T(1,3, 6), T( 1, 4, 8), T( 2, 4, 7), T( 2, 5, 9),

T(3,4, 5), T(3,6,10), T(3,7,12), T( 4, 7,11), T( 4, 8,13), T( 5, 8,12),

Line 3,727:

reg l;

foreach g in (G){ if(l=solve(N,1,g)) break; }

println(l and l or "No solution found.");</~~lang~~>

println(l and l or "No solution found.");</syntaxhighlight>