<h3 class='likesectionHead' id='the-weekly-challenge-prolog-solutions'><a id='x1-1000'></a>The Weekly Challenge 316 (Prolog Solutions)</h3>

The examples used here are from the weekly challenge problem statement and demonstrate the working solution. Part 1: Circular You are given a list of words. Write a script to find out whether the last character of each word is the first character of the following word. We can do this in a single predicate which recursively examines the list of words, which we’ll take as a list of character code…