---
title: "Discussion on \"Optimal Route Planning: A Brute Force Solution\" | Hashnode"
description: "Discussion on \"Optimal Route Planning: A Brute Force Solution\". 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. \nA..."
url: "https://hashnode.com/posts/optimal-route-planning-a-brute-force-solution/618f957383e4212d6e57849a"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Optimal Route Planning: A Brute Force Solution](https://picolisp-explored.com/optimal-route-planning-a-brute-force-solution?utm_source=hashnode&utm_medium=feed)

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...

Nov 13, 2021 · 6 min read · picolisp-explored.com  
Read the article

-   [#logic](https://hashnode.com/tag/logic)
-   [#functional-programming](https://hashnode.com/tag/functional-programming)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Mia Temma](https://hashnode.com/@miatemma)

@miatemma · Berlin, Germany

  
[View profile](https://hashnode.com/@miatemma)

## Responses 1

Markdown supported · ⌘↵ to post

[Phil Stark](https://hashnode.com/@stark22)

[Aug 15, 2024](https://hashnode.com/posts/optimal-route-planning-a-brute-force-solution/618f957383e4212d6e57849a/comment/66be7ecf191ecc4685b91c70)

good stuff