Prolog Programming Language

Traversal with Prolog For this programming assignment, we will be writing a program in Prolog that will tell us how to get from one room of a one-story building, to any other room in that building (if it's possible), by telling us all of the rooms we must go through to get to the destination room. In addition to the previous statement, there will be phones ringing in one or more of the rooms. Our prolog program should ONLY tell us how to get to those rooms. If we attempt to go to a room that does not have a ringing phone, the program should not produce any output. 1. 2. 3. Prolog code (90%) README.md (1056) Bonus (5%) 1 Fully runnable prolog code (traversal pl) 2. Project document "markdown" file (README.md) Notes .We will test your results by running your code. If it is not nunning, mention in README which part is unfinished. If not mentioned in README, points will be given zerco. .All files should be zipped into a single file for submission on Canvas named (Project3 LastNameFirst Name.zip). Make sure you submit required files only, any kind of missing or extra submission will not be graded after late submission period There are a couple of conditions that we should think about to help us frame the problem and hopefully help us understand how we should approach this problem. 1) IfI give the program a starting room and an ending room, if there is a phone ringing in the ending room, 2) Alternatively, if I give the program a starting room and an ending room, and there is no phone ringing in 3) If I only give the program a starting room. The program should give me every possible sequence of rooms the program should tell me how to get to that room (which rooms do I need to go through?). that room, the program should not return any output (actually, prolog should just print "no") that I could go through, starting from the starting room that I gave it, to reach any room with a phone ringing If I only give the program an ending room, if there is a ringing phone in that room, the program should give me every possible sequence of rooms that I could go through (including multiple starting rooms, and all sequences that start with each of those rooms) to reach that room. If there is no phone ringing, it should simply return"no Finally, if I don't give the program any starting or ending room, it should simply return every possible sequence of rooms I must go through to reach all of the rooms with phones ringing (should be a lot!). 4) 5) For the bonus, in addition to listing the sequences (steps 1-5 above), the program should also display how many rooms we had to traverse. There are two parts to the bonus. They are worth 5 points each. In addition to printing how many rooms we had to traverse you should: 1) Only list the shortest sequence of rooms to get to a given room with a phone ringing. That means if there are 3 phones ringing, you should only display 3 sequences; the shortest sequence to get to each of the rooms with a phone ringing. TIP: This only has to work for conditions where you AT LEAST know the starting room (so #4 above doesn't have to do this correctly). a. 2) Only list the longest sequence of rooms to get to a given room with a phone ringing. a. TIP: same as tip for the previous bonus Traversal with Prolog For this programming assignment, we will be writing a program in Prolog that will tell us how to get from one room of a one-story building, to any other room in that building (if it's possible), by telling us all of the rooms we must go through to get to the destination room. In addition to the previous statement, there will be phones ringing in one or more of the rooms. Our prolog program should ONLY tell us how to get to those rooms. If we attempt to go to a room that does not have a ringing phone, the program should not produce any output. 1. 2. 3. Prolog code (90%) README.md (1056) Bonus (5%) 1 Fully runnable prolog code (traversal pl) 2. Project document "markdown" file (README.md) Notes .We will test your results by running your code. If it is not nunning, mention in README which part is unfinished. If not mentioned in README, points will be given zerco. .All files should be zipped into a single file for submission on Canvas named (Project3 LastNameFirst Name.zip). Make sure you submit required files only, any kind of missing or extra submission will not be graded after late submission period There are a couple of conditions that we should think about to help us frame the problem and hopefully help us understand how we should approach this problem. 1) IfI give the program a starting room and an ending room, if there is a phone ringing in the ending room, 2) Alternatively, if I give the program a starting room and an ending room, and there is no phone ringing in 3) If I only give the program a starting room. The program should give me every possible sequence of rooms the program should tell me how to get to that room (which rooms do I need to go through?). that room, the program should not return any output (actually, prolog should just print "no") that I could go through, starting from the starting room that I gave it, to reach any room with a phone ringing If I only give the program an ending room, if there is a ringing phone in that room, the program should give me every possible sequence of rooms that I could go through (including multiple starting rooms, and all sequences that start with each of those rooms) to reach that room. If there is no phone ringing, it should simply return"no Finally, if I don't give the program any starting or ending room, it should simply return every possible sequence of rooms I must go through to reach all of the rooms with phones ringing (should be a lot!). 4) 5) For the bonus, in addition to listing the sequences (steps 1-5 above), the program should also display how many rooms we had to traverse. There are two parts to the bonus. They are worth 5 points each. In addition to printing how many rooms we had to traverse you should: 1) Only list the shortest sequence of rooms to get to a given room with a phone ringing. That means if there are 3 phones ringing, you should only display 3 sequences; the shortest sequence to get to each of the rooms with a phone ringing. TIP: This only has to work for conditions where you AT LEAST know the starting room (so #4 above doesn't have to do this correctly). a. 2) Only list the longest sequence of rooms to get to a given room with a phone ringing. a. TIP: same as tip for the previous bonus