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/index.html | 352 +++++++++++++++++++++++++++++++++++------------------- 1 file changed, 231 insertions(+), 121 deletions(-) (limited to 'public/index.html') diff --git a/public/index.html b/public/index.html index 5c52420..63133a5 100644 --- a/public/index.html +++ b/public/index.html @@ -1,173 +1,283 @@ - - - - + + + - - - - - - - - - + + + + + - - + + - - - + + - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+
+ - - - - +
+ +
+ +
+ + +
- - - - - - - - - - - - -
-
- + -
-

- -

-
-
-
-
- +
+ +

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

+

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.

+ +
- - - - - + +
+ [] +
+ + + +
+

+ ThinkPad E470 +

- -
- + -
- -
+
+ +
+

+ Types and Programming Languages +

+ + + + +
+ - + -
- +
- -
+ + -- cgit v1.2.3