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

The examples used here are from the weekly challenge problem statement and demonstrate the working solution. Part 1: Consecutive One You are given a binary array containing only 0 or/and 1. Write a script to find out the maximum consecutive 1 in the given array. Our solution is short and will be contained in a single file that has the following structure. "ch-1.p" 1 ≡ ⟨ state of the count 2 ⟩ ⟨…