TSP and A-star

Hi to all,

how would you model the state space of a Traveling Salesman Problem in
order to use the A* algorithm?

I have in mind only one representation:
1]
Represent all possible permutations of the number 1..n, where n is the
number of the cities, with a tree. See for example http://
www.techuser.net/randpermgen.html

Thanks

.

Relevant Pages

  • Re: Strong AI Thesis (No Chinese room, I promise)
    ... My objection was that you are using the word "existence" differently from most ... so-called "mind" is simply the outcome of the 100% physical brain. ... The quicksort algorithm, when it's not just a physical hardware ...
    (comp.ai.philosophy)
  • Re: No Set Contains Every Computable Natural (was Church-Turing compared to Zuse-Fredkin thesis)
    ... Russell is right about Turing saying this, ... You might not want to call this an algorithm which has ... decimal representation of x digit by digit. ...
    (comp.theory)
  • rapidly converging rational sqrt
    ... I do not know if this algorithm is new, ... We designate the tail of this continued fraction using ... representation has the form: ... If the evaluation of the first n terms produced ...
    (sci.math.research)
  • Re: Is there "an unconscious"?
    ... >> non-corporeal executive mind. ... Who perceives that constructed reality? ... representation are huge. ... No doubt their perception differs from ours- human vision ...
    (sci.psychology.psychotherapy.moderated)
  • Re: printf "%.100f" the value 2 ^ (-127)
    ... > I was trying to imagine an algorithm that, for at least one finite FP ... > representation, would output an infinite series of digits. ... This range contains an infinite number of rational values. ... or as a periodic decimal fraction (e.g. ...
    (microsoft.public.vc.language)