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

Published on 12 May 2024 09:40 PM
#Racket

How to resolve the algorithm 4-rings or 4-squares puzzle step by step in the Racket 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 Racket programming language

Source code in the racket programming language

#lang racket

(define solution? (match-lambda [(list a b c d e f g) (= (+ a b) (+ b c d) (+ d e f) (+ f g))]))

(define (fold-4-rings-or-4-squares-puzzle lo hi kons k0)
  (for*/fold ((k k0))
            ((combination (in-combinations (range lo (add1 hi)) 7))
             (permutation (in-permutations combination))
             #:when (solution? permutation))
            (kons permutation k)))

(fold-4-rings-or-4-squares-puzzle 1 7 cons null)
(fold-4-rings-or-4-squares-puzzle 3 9 cons null)
(fold-4-rings-or-4-squares-puzzle 0 9 (λ (ignored-solution count) (add1 count)) 0)

You may also check:How to resolve the algorithm Angle difference between two bearings step by step in the Modula-2 programming language
You may also check:How to resolve the algorithm Box the compass step by step in the AutoIt programming language
You may also check:How to resolve the algorithm Visualize a tree step by step in the Factor programming language
You may also check:How to resolve the algorithm Associative array/Creation step by step in the PHP programming language
You may also check:How to resolve the algorithm Cyclotomic polynomial step by step in the Phix programming language