• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • CommentGo Back
Download
 
SU-MA-DO Nº 102
GuillermoVerger
SU-MA-DO is a logic game. It is an opportunity for mental exercise and fun at the same time.There are circles joined by lines so as to form squares and triangles. There are variouskinds of SU-MA-DOs depending on the quantity of circles. In each of them there is a numberranging from 1 to 9 in the case of a 3x3 SU-MA-DO, from 1 to 16 if it’s a 4x4 SU-MA-DO andfrom 1 to 25 if it’s a 5x5 SU-MA-DO. The number inside each triangle or square is the sum ofvalues of the circles of that figure.
The objective of the game is to figure out the valuesoff each circle
. Some of the circles already have their values. The more circles ther are inthe SU-MA-DO, the higher level of difficulty you’ll face.SU-MA-DO 3 X 3 SU-MA-DO 4 X 4SU-MA-DO 5 X 5
 
-2 -
Guide to solve a SU-MA-DO
A few days ago a friend whom I invited to play SU-MA-DO stated the following: I’m unable tostart. I want to see an example of resolution. Since it is likely that this is the situation ofother seemed like a good idea to show one possible way to solve the game. And I say onepossible way to solve because there must be several. For example considering a system ofequations or by trial and error. Personally I'm attracted to follow a logical reasoning to deducethe result.
Starting the resolution
First we see what the problem is. There are nine circles occupying the vertices of 6 figures,squares and triangles. In each figure was written the sum of numbers located at thevertices. The nine vertices are assigned different numbers: one through nine. Two of themare given. The objecto of the game is to deduce the remaining seven.To illustrate the solving process we take an example.There are seven numbers remaining to be assigned to the seven empty circles:
1–2–3–4–5–8–9
The empty circles are identified by letters.Being no direct indicator of how to assign the numbers, any number can go in any corner.Now the idea is to gradually reduce the numbers that can be given at each vertex. That waywhen a vertex can be a single number, is assigned and removed from the numbers that canbe assigned to the remaining vertices.
 
-3 -
The reduction of the possible numbers assigned to each vertexthe will be done using twocriteria:

If all vertices but one has the smallest numbers available, then the remainingvertexshall be responsible for the largest number possible.

Conversely, if all vertices but one has the highest number available, then theremaining vertexshall be responsible for the smallest number possible.We begin by applying these criteria in the most extreme cases. In our case the triangle sum10 may not have very large numbers at the vertices. if set to '1 'and '2' to two of the vertex,then the third should be '7 '. This is not possible, since '6 'and '7' are alreadyallocated. Therefore the bigger number assignable is '5 '. The forms available for adding 10are:

5 + 4 + 1

5 + 3 + 2From this it follows that the '5 'should be in one of these three circles studied.The sum of the vertices 'd' + 'f' + 'g' is 17 and the sum of the vertices 'd' + 'and' + 'g' is10. Being that the vertex'd' and 'g' are shared in both sums, then it must be:
'f' = 'e'+ 7
Since the largest available number is '9 ', we deduce that' f 'can be: 8 or 9. And the valueassigned to ‘e’ is 1 or 2.The latter conclusion also tells us that the number will fall to '5 'g' or 'd'In the lower left area of the graph there is a square whose vertices are identified as ' c',' d', '6'and 'f' and add to 19. From where 'c' + 'd' + 'f' = 13 .We know that 'f' can be 8 or 9. Then: 'c' + 'd' = 5 or 4. As the lower value assigned is 1, then'c' and 'd' must be less than 5.Remember that either ‘d’ or ‘g’ must be 5. So, eliminating 5 from the values that can beassigned to 'd', we're finding the first number: 'g' = 5
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...