How to resolve the algorithm Evolutionary algorithm step by step in the CLU programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Evolutionary algorithm step by step in the CLU programming language

Table of Contents

Problem Statement

Starting with:

Note: to aid comparison, try and ensure the variables and functions mentioned in the task description appear in solutions

A cursory examination of a few of the solutions reveals that the instructions have not been followed rigorously in some solutions. Specifically, Note that some of the the solutions given retain characters in the mutated string that are correct in the target string. However, the instruction above does not state to retain any of the characters while performing the mutation. Although some may believe to do so is implied from the use of "converges" Strictly speaking, the new parent should be selected from the new pool of mutations, and then the new parent used to generate the next set of mutations with parent characters getting retained only by not being mutated. It then becomes possible that the new set of mutations has no member that is fitter than the parent! As illustration of this error, the code for 8th has the following remark. NOTE: this has been changed, the 8th version is completely random now Clearly, this algo will be applying the mutation function only to the parent characters that don't match to the target characters! To ensure that the new parent is never less fit than the prior parent, both the parent and all of the latest mutations are subjected to the fitness test to select the next parent.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Evolutionary algorithm step by step in the CLU programming language

Source code in the clu programming language

fitness = proc (s, t: string) returns (int)
    f: int := 0
    for i: int in int$from_to(1,string$size(s)) do
        if s[i] ~= t[i] then f := f-1 end
    end
    return(f)
end fitness

mutate = proc (mut: int, s: string) returns (string)
    own charset: string := " ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    out: array[char] := array[char]$predict(1,string$size(s))
    for c: char in string$chars(s) do
        if random$next(10000) < mut then
            c := charset[1+random$next(string$size(charset))]
        end
        array[char]$addh(out,c)
    end
    return(string$ac2s(out))
end mutate

weasel = iter (mut, c: int, tgt: string) yields (string)
    own charset: string := " ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    start: array[char] := array[char]$[]
    for i: int in int$from_to(1,string$size(tgt)) do
        array[char]$addh(start,charset[1+random$next(string$size(charset))])
    end    
    cur: string := string$ac2s(start)
    while true do
        yield(cur) 
        if cur = tgt then break end
        best: string := cur
        best_fitness: int := fitness(cur, tgt)
        for i: int in int$from_to(2,c) do
            next: string := mutate(mut, cur)
            next_fitness: int := fitness(next, tgt)
            if best_fitness <= next_fitness then
                best, best_fitness := next, next_fitness
            end
        end
        cur := best
    end
end weasel

start_up = proc ()
    d: date := now()
    random$seed(d.second + 60*(d.minute + 60*d.hour))
    po: stream := stream$primary_output()
    for m: string in weasel(100, 1000, "METHINKS IT IS LIKE A WEASEL") do
        stream$putl(po, m)
    end
end start_up

  

You may also check:How to resolve the algorithm Events step by step in the Go programming language
You may also check:How to resolve the algorithm Loops/Infinite step by step in the Intercal programming language
You may also check:How to resolve the algorithm Haversine formula step by step in the МК-61/52 programming language
You may also check:How to resolve the algorithm Exceptions step by step in the Phix programming language
You may also check:How to resolve the algorithm Arithmetic evaluation step by step in the OCaml programming language