Skip to content
Used to solve a problem on the puzzling stack exchange
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
screenshots
README.md
solve.c

README.md

Four-Magic-Eclipses

This code was used to solve a problem on the puzzling stack exchange

Contents

The Question

[Back to contents]

diagram1

These four ellipses represent four sets and all the possible ways they can intersect (a Venn diagram, in other words). There are 8 regions inside each ellipse, and 15 regions altogether.

Is it possible to assign the numbers 1 to 15 to the fifteen regions so that the sum of the numbers in each ellipse is the same?

My Solution

[Back to contents]

View the problem along with my answer here

diagram

Solve.c outputs the values of each section of the eclipses in the following alphabetical form:

[A,B,C,D,E,F,G,H,I,J,K,L,M,N,O]

Refer to the comments in the main file solve.c for further explanation.

Sample Video

[Back to contents]

Output

Find Me

[Back to contents]

You can’t perform that action at this time.