Did you know ... Search Documentation:
Predicate findall/3
Availability:built-in
Source[ISO]findall(+Template, :Goal, -Bag)
Create a list of the instantiations Template gets successively on backtracking over Goal and unify the result with Bag. Succeeds with an empty list if Goal has no solutions.

findall/3 is equivalent to bagof/3 with all free variables appearing in Goal scoped to the Goal with an existential (caret) operator (^), except that bagof/3 fails when Goal has no solutions.

Tags are associated to your profile if you are logged in
Tags:
Peter MOUEZA 2 said (2024-02-12T08:08:04):0 upvotes 0 0 downvotes
Picture of user Peter MOUEZA 2.
Geoffrey Churchill : exactly what I meant. Thank you !
Geoffrey Churchill said (2023-06-06T16:49:38):0 upvotes 0 0 downvotes
Picture of user Geoffrey Churchill.
Peter MOUEZA do you mean that you don't want the ellipses truncating the output? You can add maplist(writeln, Bag) to explicitly write every solution, or execute set_prolog_flag(answer_write_options, [max_depth(1000)]). before your goal to increase the printing depth from 10 to 1000.
Peter MOUEZA said (2023-04-24T21:31:29):0 upvotes 0 0 downvotes
Picture of user Peter MOUEZA.

:- use_module(library(clpfd)).

play(J1,J2,NbJoeurs) :- Subb #= NbJoeurs -1, between(1,Subb ,J1), between(2,NbJoeurs,J2), J1 #< J2.

findall(play(X,Y), play(X,Y,6),Bag).

It does not print all solutions, there are ...

Bag = [play(1, 2), play(1, 3), play(1, 4), play(1, 5), play(1, 6), play(2, 3), play(2, 4), play(2, 5), play(..., ...)|...].

How to have all solutions ?