Not logged in. · Lost password · Register

 Member since Nov 2018 1 post 2018-11-20, 20:28   #1   Subject: Assignment 4 - Prolog? Hi all, are we supposed to write a Prolog file in assignment 4 to prove that the functions find the solutions with most Cherries first? Thanks for your help.
 ModKrypt Tutor WS19/20 Member since Oct 2014 100 posts 2018-11-20, 20:38   #2   +1 ij66alux Quote by ij66alux:Hi all, are we supposed to write a Prolog file in assignment 4 to prove that the functions find the solutions with most Cherries first? Thanks for your help. No, you should not write a Prolog program for that. Please use mathematical reasoning in order to show that! ( meaning that you should write some sentences in English/German) You may use all Theorems / Definitions we introduced in the lecture to show that. "Debugging is like doing surgery by randomly squeezing stuff in a patient's body and going like 'lmao tell me when this guy stops breathing'." -- Orteil, Creator of Cookie-Clicker This post was edited on 2018-11-20, 20:39 by tyr.
 Member since Oct 2018 18 posts 2018-11-22, 22:42   #3   One more question to Assignment 4: Is it one cherry per node or may there be as many cherries as possible (range 0-15) in one node? Of course considering the random distribution, so 15 in one node is not helpful. Thank you, Matthias
 ModKrypt Tutor WS19/20 Member since Oct 2014 100 posts 2018-11-22, 22:48   #4   Quote by oh01ahyz:Is it one cherry per node or may there be as many cherries as possible (range 0-15) in one node? Of course considering the random distribution, so 15 in one node is not helpful. Nodes are binary: Cherry or Nothing. If you have some experience with LaTeX, I suggest to have a look at my template https://gl.kwarc.info/teaching/AI/blob/master/Marius/uebun… . "Debugging is like doing surgery by randomly squeezing stuff in a patient's body and going like 'lmao tell me when this guy stops breathing'." -- Orteil, Creator of Cookie-Clicker
 Member since Oct 2018 18 posts 2018-11-22, 23:44   #5   I have thought in the meantime about it and I actually came to the conclusion that our A* search task makes only sense when there may be more than 1 cherry at one node, so your answer surprised me a bit So, if I understand you correctly, there are multiple equivalent solutions for the search problem, for example two paths which have a cherry in each consecutive node. Also this would imply that the maximum number of cherries that are collectable is 4, right? I am already using your template by the way. It is super helpful, so thanks a lot!
 ModKrypt Tutor WS19/20 Member since Oct 2014 100 posts 2018-11-23, 00:20   #6   Quote by oh01ahyz:So, if I understand you correctly, there are multiple equivalent solutions for the search problem, for example two paths which have a cherry in each consecutive node. Also this would imply that the maximum number of cherries that are collectable is 4, right? Yes, that's correct! (or more precisely: if the root is a Cherry, 5 is also possible!) "Debugging is like doing surgery by randomly squeezing stuff in a patient's body and going like 'lmao tell me when this guy stops breathing'." -- Orteil, Creator of Cookie-Clicker This post was edited on 2018-11-23, 00:30 by tyr.