home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #18 / NN_1992_18.iso / spool / comp / ai / 3126 < prev    next >
Encoding:
Text File  |  1992-08-17  |  1.4 KB  |  66 lines
  1. Newsgroups: comp.ai
  2. Path: sparky!uunet!usc!sol.ctr.columbia.edu!The-Star.honeywell.com!umn.edu!lynx!nmsu.edu!opus!eiverson
  3. From: eiverson@nmsu.edu (Eric Iverson)
  4. Subject: Solving the 8 puzzle through hill climbing
  5. Message-ID: <EIVERSON.92Aug18010623@ithaka.nmsu.edu>
  6. Sender: usenet@nmsu.edu
  7. Organization: Computing Research Lab
  8. Distribution: comp
  9. Date: Tue, 18 Aug 1992 08:06:23 GMT
  10. Lines: 54
  11.  
  12.  
  13. Below is a brief series of steps to solve one configuration of the 8
  14. puzzle.  I am looking for a fitness function such that each successive
  15. step would be judged to be more fit than its predecessor, thus enabling
  16. hill climbing.  I realize that hill climbing is not the best way to
  17. solve the 8 puzzle, but that's what I want to do.  (No, this isn't
  18. homework.  It's a question in Rich's textbook that I just happen to be
  19. rereading.)  Any suggestions would be appreciated.
  20.  
  21. [1,2,3]
  22. [8,5,6]
  23. [4,7,*]
  24.  
  25. [1,2,3]
  26. [8,5,*]
  27. [4,7,6]
  28.  
  29. [1,2,3]
  30. [8,*,5]
  31. [4,7,6]
  32.  
  33. [1,2,3]
  34. [*,8,5]
  35. [4,7,6]
  36.  
  37. [1,2,3]
  38. [4,8,5]
  39. [*,7,6]
  40.  
  41. [1,2,3]
  42. [4,8,5]
  43. [7,*,6]
  44.  
  45. [1,2,3]
  46. [4,*,5]
  47. [7,8,6]
  48.  
  49. [1,2,3]
  50. [4,5,*]
  51. [7,8,6]
  52.  
  53. [1,2,3]
  54. [4,5,6]
  55. [7,8,*]
  56.  
  57. --
  58. ------------------------------------------------------------------------
  59. Eric Iverson                Internet: eiverson@nmsu.edu
  60. Computing Research Lab
  61. Box 30001/3CRL                Life is something to do when
  62. New Mexico State University        you can't get to sleep.
  63. Las Cruces, NM 88003-0001            -Fran Lebowitz
  64. VOICE: (505) 646-5711    
  65. FAX:   (505) 646-6218
  66.