mind_read_mr_tree.pl

%% mr_tree.pl

% swipl --goal=main2 --stand_alone=true -o mind_read -c mind_read.pl 
% ./mind_read

:-include('../Philosophy/decision_tree.pl').

%main2:-time((length(A,30),time(findall(B,(member(_,A),mind_read(B, [11, 22])),C)),writeln(C))),!.

get_type(A,list) :- is_list(A),!.
join_san(P,list,P) :- !.

%mind_read(A,B) :-random_member(A,B),!.

mind_read(Item,[Item]) :- !.
mind_read(Item,List0) :-


findall([A,Type],(member(A1,List0),once(get_type(A1,Type)), (Type=list->A1=A;string_strings(A1,A))),List2),
findall(B,member([B,_],List2),List3),
decision_tree(List3,List1),
%trace,
mind_read3([],P,List1),
member([P,Type1],List2),
join_san(P,Type1,Item),
!.

mind_read3(Progress1,Progress2,[]%,_%,%Tree1,
%Item2,Item1
) :-
	%(fail,member([Item2,_,[]],Tree1)->true;
	%[Item2,_,[]]=Tree1),
	append(Progress1,[%Item2
	],Progress2),!.
mind_read3(Progress1,Progress2,Options2%,_Options%,%Tree1,
%Item2,Item1
) :-
%trace,
	%subtract2(Tree1,Options,[],Tree2),
	
	%(true%length(Options2,1)
	%->findall(A,member([_,_,A],Options2)%,length(A,L))
	%,A1);(trace,
	%Options2=[_,_,A],%trace,
	%A1=[A])),
	%foldr(append,A1,A2),
	%mind_read10([Item2,_,A2],Options2),
	mind_read10(%Tree1,
	[Item2,_,A2],Options2),
	%(member([Item2,_,A3],Options2)->true;[Item2,_,A3]=Options2),member(Item1,A3),
	append(Progress1,[Item2],Progress4),
	mind_read3(Progress4,Progress2,A2%,_Options%,%Tree1,
	%Item2,Item1
	).
	
mind_read10("",[]) :- !.
mind_read10(Item,[Item]) :-
	writeln1([item,Item]),!.
mind_read10(Item,List) :-
writeln1([list,List]),
%trace,
%%catch(
	(trialy2_mr(List,R1),
	findbest_mr(R1,Item),
	writeln1([item,Item]))
   %_,
	%mind_read10(Item,List)
	%)
	,
!.
	%%random_member(Item,List),!.

trialy2_mr([],R) :-
	R=[[_,['C']]].
	%%writeln([[],in,trialy2_mr]),abort.
trialy2_mr(List,R) :-
	length(List,Length),

%%writeln([list,List]),
%%notrace,
log(Length,A),log(10,C),B is floor(A/C)+1,
numbers(B,1,[],D),
findall(R,(member(_E,D),findr4(R1),number_string(R1,R)),RL),
B2 is floor(10^((floor(A/C)+1))-1),
formr5(RL,B2,Length,R5),
findr(R5,List,R).

findr4(R4) :-
		List1=[0,1,2,3,4,5,6,7,8,9],
		Trials is 10,
%catch(
	(trialy22(List1,Trials,[],R1),
	findbest2_mr(R1,R4)
	%writeln1([item,Item])
	)
   %_,
	%findr4(R4)
	%)
	.
		%%number_string(R3,R2),
formr5(RList,Upper,Length,R5) :-
		%%findall(D,(member(C,RList),floor(C,D)),RList2),
		concat_list2A(RList,R5A),
		number_string(R5B,R5A),
		R51 is floor((R5B/Upper)*Length),
		(R5B=Upper->R5 is R51-1;R5=R51).
findr(R4,List,R) :-
		%%floor(R4,R4A),		
		length(A,R4),
		append(A,[R|_],List).

	%%random_member(A,List),
	%%R=[[_,A]].
	
	/**
	length(List,L),
	Trials is L*3,
	trialy22(List,Trials,[],R).**/

trialy22([],_,R,R) :- !.
trialy22(List,Trials,RA,RB) :-
	List=[Item|Items],
	trialy21(Item,Trials,R1),
	append(RA,[R1],RC),
	trialy22(Items,Trials,RC,RB),!.

trialy21(Label,Trials,RA) :-
	trialy3(Trials,[],R),
	aggregate_all(count, member(true,R), Count),
	RA=[Count,Label].

trialy3(0,R,R) :-!.
trialy3(Trials1,RA,RB) :-
	trialy1(R1),
	append(RA,[R1],RC),
	Trials2 is Trials1-1,
	trialy3(Trials2,RC,RB),!.
	
%% try other nouns
trialy1(R1) :-
	%%control11(A1),
	trial0(A22), %% Control
	sum(A22,0,S22),
	mean(S22,A1),
	trial0(A21), %% Test 1
	sum(A21,0,S02),
	mean(S02,A2),
	(A1>A2->R1=true;R1=fail).

trial0(S3) :- N is 10, 
catch(
	(trial1(N,[],S),trial01(S,S3)),
   _,
	trial0(S3)).
trial01(S1,S3) :-
	sort(S1,S),
	%%midpoint(S,MP),
	halves(S,H1,H2),
	midpoint(H1,Q1),
	midpoint(H2,Q3),
	IQR is Q3-Q1,
	sum(S,0,S02),
	mean(S02,Mean),
	furthestfrommean(S,Mean,V),
	D1 is 1.5*IQR,
	D2 is V-Mean,
	(D2>D1->(delete(S,V,S2),trial01(S2,S3));S=S3).
	
trial1(0,A,A) :- !.
trial1(N,A,B) :- mindreadtest(S), append(A,[S],A2),
	N1 is N-1,trial1(N1,A2,B).
	
midpoint(S,MP) :-
	length(S,L),
	A is mod(L,2),
	(A is 0->
		(M1 is L/2, M2 is M1+1,N1 is M1-1,N2 is M2-1,length(N11,N1),length(N21,N2),append(N11,[N12|_Rest1],S),append(N21,[N22|_Rest2],S),MP is (N12+N22)/2)
	;
		(L2 is L+1, M1 is L2/2, N1 is M1-1,length(N11,N1),append(N11,[MP|_Rest],S))).

halves(S,H1,H2) :-
	length(S,L),
	A is mod(L,2),
	(A is 0->
		(M1 is L/2,length(H1,M1),append(H1,H2,S))
	;
		(L2 is L-1,M1 is L2/2,length(H1,M1),append(H1,[_|H2],S))).

sum([],S,S):-!.
sum(S0,S1,S2) :-
	S0=[S3|S4],
	S5 is S1+S3,
	sum(S4,S5,S2).
	
mean(Sum,Mean) :-
	Mean is Sum/2.

furthestfrommean(S,Mean,V) :-
	absdiffmean(S,Mean,[],D),
	sort(D,D1),
	reverse(D1,[[_,V]|_Rest]).

absdiffmean([],_M,D,D) :- !.
absdiffmean(S,M,D1,D2) :-
	S=[S1|S2],
	S3 is abs(S1-M),
	append(D1,[[S3,S1]],D3),
	absdiffmean(S2,M,D3,D2).

mindreadtest(Sec) :-
	%% 250 br for characters to be br out with 10 br each from person to me - do when initial 250 br test done and doing 10 br test
	%%comment(fiftyastest),
	%%random(X),X1 is 10*X, X2 is floor(X1), (X2=<2 -> (
	%%texttobr,writeln(['true test']), %%); %% use breasonings breasoned out by computer for not by me, for job medicine for "me", at last time point
	%%true), %% leave last time point blank
	%%**texttobr2(640);true),%% make an A to detect reaction to gracious giving or blame of in following
	get_time(TimeStamp1),
	%%phrase_from_file(string(_String), 'file.txt'),
	texttobr2(2), %% 100 As for answer (must be br before this on same day)
	%% is gracious giving or blame
	get_time(TimeStamp2),
	%%comment(turnoffas),
   Sec is TimeStamp2 - TimeStamp1.

findbest_mr(R,R) :-!.
findbest2_mr(R,Item):-
	sort(R,RA),
	reverse(RA,RB),
	RB=[[_,Item]|_Rest].


% mind_read_create_dt([1,2,3],DT,Types).

mind_read_create_dt(List0,List1,Types) :-

findall([A,Type],(member(A1,List0),once(get_type(A1,Type)), (Type=list->A1=A;string_strings(A1,A))),Types),
findall(B,member([B,_],Types),List3),
decision_tree(List3,List1),!.


% mind_read_dt_filled(Item,DT,Types).

mind_read_dt_filled(Item,[Item],List2) :- !.
mind_read_dt_filled(Item,List0,List2) :-


%trace,
mind_read3([],P,List0),
member([P,Type1],List2),
join_san(P,Type1,Item),
!.