Series

Algorithm Classics from the Rosetta Code

Sometimes an example says more than 1000 pages of documentation. This series will take specific algorithmns and discuss their implementation in PicoLisp step by step. https://rosettacode.org/

Articles in this series

The Forest Fire Model: Let it burn!

Nov 30, 20214 min read

The Task Implement the Drossel and Schwabl definition of the forest-fire model. It is basically a 2D cellular automaton where each cell can be in three distinct states: empty, tree and burning, and evolves according to the following rules: A burni...

The Forest Fire Model: Let it burn!

Optimal Route Planning: A Brute Force Solution

Nov 13, 20216 min read

This task is actually not included in the Rosetta code, but still it is a quite frequent algorithmic task: How to find the optimal path between two nodes of a graph. In this post, we will show a brute-force solution using Pilog to get from A to B. A...

Optimal Route Planning: A Brute Force Solution

Dinesman's Multiple Dwelling Problem

Nov 12, 20214 min read

The original task is from the book "Superior Mathematical Puzzles" from Howard P. Dinesman. The Task Baker, Cooper, Fletcher, Miller, and Smith live on different floors of an apartment house that contains only five floors. Baker does not live on t...

Dinesman's Multiple Dwelling Problem

Who owns the Zebra? - A Logic Puzzle

Nov 11, 20219 min read

"98% of the world population cannot solve this task." (Fake quote attributed to Albert Einstein)

Who owns the Zebra? - A Logic Puzzle

The Towers Of Hanoi

Nov 10, 20215 min read

Implemented in Logical and Functional Programming

The Towers Of Hanoi

Web Apps: An Animation

Oct 17, 20217 min read

Task Create a window containing the string "Hello World! " (the trailing space is significant). Make the text appear to be rotating right by periodically removing one letter from the end of the string and attaching it to the front. When the user cli...

Web Apps: An Animation