How to resolve the algorithm 4-rings or 4-squares puzzle step by step in the Picat programming language

Published on 12 May 2024 09:40 PM
#Picat

How to resolve the algorithm 4-rings or 4-squares puzzle step by step in the Picat programming language

Table of Contents

Problem Statement

Replace       a, b, c, d, e, f,   and   g       with the decimal digits   LOW   ───►   HIGH such that the sum of the letters inside of each of the four large squares add up to the same sum. Show all output here.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm 4-rings or 4-squares puzzle step by step in the Picat programming language

Source code in the picat programming language

import cp.

main => 
  puzzle_all(1, 7, true, Sol1),
  foreach(Sol in Sol1) println(Sol) end,
  nl,
  
  puzzle_all(3, 9, true, Sol2),
  foreach(Sol in Sol2) println(Sol) end,
  nl,
  
  puzzle_all(0, 9, false, Sol3),
  println(len=Sol3.len),
  nl.

puzzle_all(Min, Max, Distinct, LL) => 
    L = [A,B,C,D,E,F,G],
    L :: Min..Max,
    if Distinct then 
      all_different(L)
    else
      true
    end,
    T #= A+B,
    T #= B+C+D,
    T #= D+E+F,
    T #= F+G,
    % Another approach:
    % Sums = $[A+B,B+C+D,D+E+F,F+G],
    % foreach(I in 2..Sums.len) Sums[I] #= Sums[I-1] end,
    LL = solve_all(L).

You may also check:How to resolve the algorithm Modular exponentiation step by step in the Crystal programming language
You may also check:How to resolve the algorithm Knapsack problem/Continuous step by step in the Elixir programming language
You may also check:How to resolve the algorithm Factors of an integer step by step in the Mercury programming language
You may also check:How to resolve the algorithm Currying step by step in the Elixir programming language
You may also check:How to resolve the algorithm Return multiple values step by step in the Lua programming language