From 32e0e105f663ace08896f22ab4079521070b0cac Mon Sep 17 00:00:00 2001 From: Amir Saeid Date: Wed, 18 Feb 2026 21:25:00 +0000 Subject: Change the theme and add a new post --- public/post/index.xml | 9 ++++++++- 1 file changed, 8 insertions(+), 1 deletion(-) (limited to 'public/post/index.xml') diff --git a/public/post/index.xml b/public/post/index.xml index bd08f3a..85cb7be 100644 --- a/public/post/index.xml +++ b/public/post/index.xml @@ -6,8 +6,15 @@ Recent content in Posts on Hugo en - Tue, 22 Aug 2017 00:00:00 +0000 + Tue, 17 Feb 2026 20:59:41 +0000 + + Fairstream + https://blog.gluegadget.com/post/fairstream/ + Tue, 17 Feb 2026 20:59:41 +0000 + https://blog.gluegadget.com/post/fairstream/ + <p><a href="https://en.wikipedia.org/wiki/Backtracking">Backtracking</a> is a versatile approach for solving search problems by building solutions incrementally. If a partial solution cannot be extended, it is discarded and the process returns to a previous step to explore an alternative path. This method is generally more efficient than brute-force searching due to pruning: stopping exploration of a branch as soon as it violates a constraint, which eliminates entire sections of the search space.</p> <p>Strictly speaking, fair backtracking is not required for all search problems. A fair strategy guarantees all branches make progress, preventing any single branch from starving the others. The List monad handles non-deterministic computation well, and within a finite search space it produces the same results as a fair stream. When the search space is infinite, or when one branch may produce unbounded results, fairness becomes essential to ensure completeness.</p> + ThinkPad E470 https://blog.gluegadget.com/post/2017-08-22-thinkpad-e470/ -- cgit v1.2.3