I have looked at the gazillions of other similar questions, but I haven’t found a working solution, so I am asking this:

I’m using: SWI-Prolog version 9.3.8

First off, I am new to Prolog, so please go easy on me… Also, I am using SWI-Prolog,
so I want to use the correct syntax for SWI.

I have created a program in prolog that plays wordle. The user chooses a word, the computer guesses a word and the user tells what the colors of the letters are. The words the computer guesses are all unbound variables:

I am new to prolog.
I read this article about structures in Prolog. However, the following code does not work:

Are rules declared with the neck (:-) equivalent to ones declared using single-sided unification (=>), in case there is no guard?

I am trying to understand the fail driven loop for an graph for example but i dont understant how it works and when to use it. When to use fail driven loops and when to use normal recursiv? I have some examples to check if they are correct or not.
The first example has to verify that there are no vertex in graph having an edge with the given weight.

I have a programm in Prolog related to a family tree, where i have to find all the sibling related to an individual.

I am writing a small interpreter in SWI Prolog and run into the following problem: I need to write a predicate that will determine if logical expression is true. I already have a predicate

% Функция для вычисления факториала
factorial(0, 1).
factorial(N, F) :-
N1 is N – 1,
factorial(N1, F1),
F is N * F1.