Hello Friends! I am designing a solution to the classic MOUSE CHEESE problem in Computer Science. There is probably an algorithmic solution but I am trying to build an expert systems solution in CLIPS.
A file contains facts about each node like the type of the node (mouse, cheese, roadblock, freecell) and neightbors ( can be maximum of 8 or minimum of 3 for corner cells in my grid or 5 along any edge but not corner) I plan to load these facts into the factlist initially. Then i plan to do some pattern matching to to create new facts called 'path' by looking up neighbors of acell which are NOT itself and not already in the factlist. if this encounters a cheese cell I print the solution. if it encounters a roadblock I must reset. This involved some thinking. Should I go all the way back and start again. no? it is probably better if I retract one level and explore other neighbors....this would be a depth first search. Should a decision tree be used. well....? lots of ideas.....I need to crystallize the design by this weekend. If any of you out there have any thoughts please let me know . I am all ears! Thanking You Yours sincerely prabhakar Srinivasan __________________________________________________ Do you Yahoo!? Y! Web Hosting - Let the expert host your web site http://webhosting.yahoo.com/ -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] --------------------------------------------------------------------
