Solve triangle solitaire puzzle: Difference between revisions

 

Reference picture:   http://www.joenord.com/puzzles/peggame/

 

 

Start with empty peg in   '''X'''   and solve with one peg in position   '''Y'''.

<br><br>

 

=={{header|D}}==

{{trans|Ruby}}

 

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

}

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

{{out}}

<pre>

0 0 1 0 0

Solved</pre>

 

=={{header|Elixir}}==

Inspired by Ruby

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

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

end

 

 

{{out}}

=={{header|Go}}==

{{trans|Kotlin}}

 

import "fmt"

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

}

 

{{out}}

 

=={{header|J}}==

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

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

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

)

Example linux session with program in file CrackerBarrel.ijs

<pre>

Print one possible solution.

 

import java.util.ArrayList;

import java.util.Arrays;

 

}

{{out}}

<pre>

=={{header|Julia}}==

{{trans|Raku}}

[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]]

end

end

<pre>

Starting board:

=={{header|Kotlin}}==

{{trans|Python}}

 

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

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

}

 

{{out}}

Peg B jumped over C to land on D

</pre>

 

=={{header|Perl}}==

{{trans|Raku}}

0

1 1

 

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

{{out}}

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

 

=={{header|Phix}}==

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).

{{out}}

<pre>

1 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 1 0 1 1 0 0 0 0 0 1 0 0

</pre>

{{out}}

<pre>

o . . . o o o o o o o o o o o o o o o o o o o o

</pre>

 

=={{header|Prolog}}==

Works with SWI-Prolog and module(lambda).

 

 

iq_puzzle :-

select(End, Free, F1),

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

Output :

<pre> ?- iq_puzzle.

=={{header|Python}}==

 

# Draw board triangle in ascii

#

AddPeg(board,land) # board order changes!

DrawBoard(board)

 

{{out}}

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

 

(define << arithmetic-shift)

(define bwbs? bitwise-bit-set?)

 

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

 

{{out}}

{{trans|Sidef}}

 

constant @start = <

0

last if $result

};

{{out}}

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

=={{header|Ruby}}==

 

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]]

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

puts l ? l : "No solution found"

{{out}}

<pre style="height:64ex;overflow:scroll">

=={{header|Sidef}}==

{{trans|Ruby}}

 

const G = [

var r = ''

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

 

{{out}}

'''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.

Imports System, Microsoft.VisualBasic.DateAndTime

 

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

End Sub

{{out}}

'''A full solution:'''

{{trans|Kotlin}}

{{libheader|Wren-fmt}}

 

var board = List.filled(16, true)

drawBoard.call()

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

 

{{out}}

Same as Kotlin entry.

</pre>

 

=={{header|zkl}}==

{{trans|D}}

{{Trans|Ruby}}

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),

reg l;

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

{{out}}

<pre style="height:32ex;overflow:scroll">