Search results for query: *

Thanks for your effort.It was so helpful for me.Do you refer any link or tutorial about how to make a chess game in Prolog where the game should be played between me and computer implementing AI?

Could you edit your above search_node() for BFS search like the way you do it for DFS?

A little bit clarification needed,do you please explain how the work is going and the function of retract(),retractall() and assert()?

I think your approach is right,i can do some modification on it according to my requirement.Thank you very much for sharing it. Give a star for your effort..[smile] Hope now i will try for BFS search according to your approach.

Thanks for your response.I think your code counts level of a node actually,it not counts iteration number according DFS search.Cosider for node 6, it counts 2 according to your code because it is in level 2.But according to DFS search,it should be 5,isn't it?

I am new in Prolog,working with trees such as forming a tree,counting nodes etc.I had done those,face problems when i am trying to apply DFS search to find a node. Below is my code so far.. constructTree(tree(1, tree(2, tree(3,nil,nil)...