Loading ...
Sorry, an error occurred while loading the content.

Degree Heuristic and Australia

Expand Messages
  • baylor
    Hi aima-talk list. i thought i understood how the degree heuristic worked on the Australia 3-color problem but according to pg 216, it guarantees solving the
    Message 1 of 1 , Mar 7, 2011
    • 0 Attachment
      Hi aima-talk list. i thought i understood how the degree heuristic worked on the Australia 3-color problem but according to pg 216, it guarantees solving the problem without backtracking and when i worked it out, that's not what i found. Since i'm assuming Russel and Peter are smarter than i am, i must be making a mistake, but i'm not sure where

      Start:
      SA is touching 5 unassigned variables
      NT, Q, NSW = 3
      WA, V = 2
      T = 0

      So far, this seems to agree with the book

      Assign Red to SA

      NT, Q, NSW = 2
      WA, V = 1
      T = 0

      Assign Green to NT

      NSW = 2
      Q, V = 1
      WA, T = 0

      Assign Green to NSW

      WA, Q, V, T = 0

      When assigning green to NSW after NT=G, i've made the problem unsolvable

      Any idea what i'm misunderstanding?

      -baylor
    Your message has been successfully submitted and would be delivered to recipients shortly.