@tomleslie 

if add extra feature to make it can feedback such as adding condition

how to do?

i find conditions are hard coded

if it output maxmize result only, then would like to feedback by add extra condition such as A, B, C can not be divisible by 7

how to add conditions programmatically?

and

if above difficult then how to add condition a,b,c not divisible by 7

@tomleslie 

how to change to output all possible set of a, b, c instead of maximise?

@Carl Love 

i would like to automate to change suspected pattern into a system equations to solve and then verify with sorting algorithm by comparing whether all data matched

@tomleslie 

error after run code

would like to test A+B <= 59  and A+B+C <= 57 too

errorinmaple2015.mw

@Carl Love 

is pattern Regex Solver equal math regex solver?

how to write a pattern regex Solver?

can accumulate function and sorting algorithm do pattern regex solver?

@acer 

will the result or accuracy different between cpu and GPU when doing numerical calculation?

@Kitonum

sorry , 

i discover missing equal operator 

it works now , please delete this question.

@acer 

I find distribution function

but still not work

I removed picture.

@Joe Riel 

I removed picture

@Carl Love 

difficult to express in screenshot

it is just my sense to test my observation hypothesis

i do not know how to use too

i think guess actual use is mark it as a change

@asa12 

sequence faster or for loop faster?

@Kitonum 

is there artificial intelligence work in this way?

@Kitonum 

thanks, i forget hashtable value  can use list too

yesterday my status is not well, today i am refresh to use python do below

chosen1 = {}
chosen2 = {}
chosen3 = {}
chosen4 = {}
chosen5 = {}
chosen1[1] = [2]
chosen1[2] = [3]
chosen2[2] = [3]
chosen2[2] = chosen2[2]  + [5]
chosen3[3] = [4]
chosen3[5] = [9]
chosen4[4] = [5]
chosen4[9] = [8]
chosen5[5] = [6]
chosen5[8] = [12]

for i0 in chosen1.keys():
    for i1 in chosen1[i0]:
        if i1 in chosen2.keys():
            for i2 in chosen2[i1]:
                if i2 in chosen3.keys():
                    for i3 in chosen3[i2]:
                        if i3 in chosen4.keys():
                            for i4 in chosen4[i3]:
                                if i4 in chosen5.keys():
                                    for i5 in chosen5[i4]: 
                                        print([i, i1, i2, i3, i4, i5]);
 

@tomleslie 

very good function

it seems not need accumulate function

@vv 

my notebook is faster to run web now.

i attached my code,

but the result different from table of the book photo

at orbit size 3 , only two number of each, but book photo show all are 3 numbers

restart:
with(combinat):
with(group):
FixPoints := (a,n) -> {seq(i,i=1..n)} minus {op(map(op,a))}:
a := [[seq(i,i=1..6)],[seq(i,i=7..9)]]:
b := a:
aa := []:
countlist := []:
for i to 6 do
tt := b;
if tt = [] then
 tt := permgroup(9, {[]}):
end if:
count := 1:
orbitlist := []:
continuerun := 0:
for j from 1 to 7 do
if continuerun = 0 then
if b = [] then
if orbit(tt,j) in orbitlist then
 continuerun := 1:
else
 orbitlist := [op(orbitlist), orbit(tt,j)]:
end if:
else
if orbit({tt},j) in orbitlist then
 continuerun := 1:
else
 orbitlist := [op(orbitlist), orbit({tt},j)]:
end if:
end if:
end if:
od:
if nops(orbitlist) in countlist then
 rr := 0:
else
 countlist := [op(countlist), nops(orbitlist)]:
 lprint('a'^i=b, "orbit size=",nops(orbitlist)):
end if:
aa := [op(aa), b]:
b := mulperms(b,a);
od: