1. Forum
  2. Usenet
  3. REC.GAMES.ABSTRACT

  • Hard puzzle

    From Moh Bel@21:1/5 to All on Fri Oct 6 07:07:08 2017
    Here is a squared grid 9x9 stars where the stars are equidistant orthogonally :

    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    An isosceles triangle has 3 vertices with the equal side of length l
    Each time you draw an isosceles triangle you remove 3 stars from the grid above as each vertex overlap a star.

    Examples :

    / * * / * * / * *
    * * * * * * * * *
    * * * * / * * * /
    / * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    The isosceles triangle (A1,A4,D1) removes 3 stars (A1,A4,D1)
    The isosceles triangle (G1,E3,I3) removes 3 stars (G1,E3,I3)

    The goal of the puzzle is :
    - to remove all the stars by drawing 27 iscosceles triangles (27*3=81)
    - the 27 iscosceles triangles MUST BE distinct. Distinct means that 2 isosceles triangles are distinct as long as their equal side are of different length l.
    To be clear : 2 isosceles triangles are equivalent even if their third side (the unequal one) is distinct.

    Can you find at least one solution?

    This puzzle gave birth to many of my abstract games most of them unpublished.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moh Bel@21:1/5 to Moh Bel on Mon Oct 9 14:41:14 2017
    On Friday, October 6, 2017 at 10:07:09 AM UTC-4, Moh Bel wrote:
    Here is a squared grid 9x9 stars where the stars are equidistant orthogonally :

    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    An isosceles triangle has 3 vertices with the equal side of length l
    Each time you draw an isosceles triangle you remove 3 stars from the grid above as each vertex overlap a star.

    Examples :

    / * * / * * / * *
    * * * * * * * * *
    * * * * / * * * /
    / * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    The isosceles triangle (A1,A4,D1) removes 3 stars (A1,A4,D1)
    The isosceles triangle (G1,E3,I3) removes 3 stars (G1,E3,I3)

    The goal of the puzzle is :
    - to remove all the stars by drawing 27 iscosceles triangles (27*3=81)
    - the 27 iscosceles triangles MUST BE distinct. Distinct means that 2 isosceles triangles are distinct as long as their equal side are of different length l.
    To be clear : 2 isosceles triangles are equivalent even if their third side (the unequal one) is distinct.

    Can you find at least one solution?

    This puzzle gave birth to many of my abstract games most of them unpublished.

    Here is one solution posted by this guy (I thank him a lot) :

    B F Q U D F A C #
    J W E P N W O G H
    K L Y V S V T Q A
    E P M X Z S U K I
    D M X Z T Z Y R G
    G I R Y Q W J L B
    C S H U V X P R T
    # C N H J O N O I
    A # K F L B M E D

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moh Bel@21:1/5 to Moh Bel on Mon Oct 9 14:39:49 2017
    On Friday, October 6, 2017 at 10:07:09 AM UTC-4, Moh Bel wrote:
    Here is a squared grid 9x9 stars where the stars are equidistant orthogonally :

    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    An isosceles triangle has 3 vertices with the equal side of length l
    Each time you draw an isosceles triangle you remove 3 stars from the grid above as each vertex overlap a star.

    Examples :

    / * * / * * / * *
    * * * * * * * * *
    * * * * / * * * /
    / * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *
    * * * * * * * * *

    The isosceles triangle (A1,A4,D1) removes 3 stars (A1,A4,D1)
    The isosceles triangle (G1,E3,I3) removes 3 stars (G1,E3,I3)

    The goal of the puzzle is :
    - to remove all the stars by drawing 27 iscosceles triangles (27*3=81)
    - the 27 iscosceles triangles MUST BE distinct. Distinct means that 2 isosceles triangles are distinct as long as their equal side are of different length l.
    To be clear : 2 isosceles triangles are equivalent even if their third side (the unequal one) is distinct.

    Can you find at least one solution?

    This puzzle gave birth to many of my abstract games most of them unpublished.

    The puzzle was solved by someone who used a program and he posted one solution. According to him there are "many thousands of solutions".

    I will post a new one soon.
    Keep in mind that each puzzle I create means 1000 abstract games are waiting to be born.
    Not all the puzzles give birth to abstract games. My puzzles are designed for such goal.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)