Lucianpedia Wiki
Explore
Main Page
All Pages
Community
Interactive Maps
Recent Blog Posts
Philosophy
Humanist Pedagogy
x
y
Breathsonings
Rebreathsoning
Room
Part of Room
Direction
Time to Prepare
Time to Do
More...
Lucian Meditation
Children/H1/Earning Jobs/Protection in Jobs
Heads of State
Lucian Mantra (Pure Form)
Lucian Mantra (Sun Safety)
Maharishi Sutra
Meditation Teacher Sutra
Moving Appearances
Purusha
Upasana Sutra
Yellow God
Metaphysics
Aphors
Popology
Agreement
More...
Music
Anarchy
Anarchy
You Are Mine
Butterfly
Icicle
Anarchy 2
Anarchy 3
Abracadabra
Abracadabra 2
Other Pop Songs
Arts College Song
Christ Church Song
Long Time Coming
Love
Pink Palace
Are You There
Gay Song
High School Song
I Want to be a Geneticist
I Want You
More Pop Songs
Apple Computer
I Want to Write a Pop Song
Magic Wand
My Computer Program
Sex
Sponge
Unreleased
The Anti-Nuclear Bomb Song
Atheism
Baby, Baby
Bingo
Breasonings
Breathsonings
Chess Club
Dinosaur
Ecstasy
More...
Computer Science
Algorithm Writer with Lists
Combination Algorithm Writer with Multiple Predicates
Music Composer
List Prolog Interpreter
State Saving Interpreter
Time Machine
More...
FANDOM
Fan Central
BETA
Games
Anime
Movies
TV
Video
Wikis
Explore Wikis
Community Central
Start a Wiki
Don't have an account?
Register
Sign In
Sign In
Register
Lucianpedia Wiki
542
pages
Explore
Main Page
All Pages
Community
Interactive Maps
Recent Blog Posts
Philosophy
Humanist Pedagogy
x
y
Breathsonings
Rebreathsoning
Room
Part of Room
Direction
Time to Prepare
Time to Do
More...
Lucian Meditation
Children/H1/Earning Jobs/Protection in Jobs
Heads of State
Lucian Mantra (Pure Form)
Lucian Mantra (Sun Safety)
Maharishi Sutra
Meditation Teacher Sutra
Moving Appearances
Purusha
Upasana Sutra
Yellow God
Metaphysics
Aphors
Popology
Agreement
More...
Music
Anarchy
Anarchy
You Are Mine
Butterfly
Icicle
Anarchy 2
Anarchy 3
Abracadabra
Abracadabra 2
Other Pop Songs
Arts College Song
Christ Church Song
Long Time Coming
Love
Pink Palace
Are You There
Gay Song
High School Song
I Want to be a Geneticist
I Want You
More Pop Songs
Apple Computer
I Want to Write a Pop Song
Magic Wand
My Computer Program
Sex
Sponge
Unreleased
The Anti-Nuclear Bomb Song
Atheism
Baby, Baby
Bingo
Breasonings
Breathsonings
Chess Club
Dinosaur
Ecstasy
More...
Computer Science
Algorithm Writer with Lists
Combination Algorithm Writer with Multiple Predicates
Music Composer
List Prolog Interpreter
State Saving Interpreter
Time Machine
More...
Editing
Mindreader
(section)
Back to page
Edit
Edit source
View history
Talk (0)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Fast Mind Reader and <span>Detailed </span>Mind Reader Tree == The Fast Mind Reader Algorithm selects from a list of whole options, i.e. "apple" or "ant". The Detailed Mind Reader (Tree) Algorithm allows selection of choice-points through options, e.g. "a", then "p" or "n", etc. Where n = the number of options in fast mind reading and m = the number of options in detailed mind reading, m=log(n). Fast mind reader and mind reader tree have error catching code for stability. The full detailed mind reading tree algorithm is as follows: === 1. Segment strings === Optionally segment strings (see mind_read_a predicate) if data is a list of equal length lists. [["abbcc","addee"],["abbcc","affgg"],["ahhii","ajjkk"],["abbjj","allmm"]] Chosen from the start of the lists, unique items "abbcc", "ahhii" and "abbjj" are chosen, then the next items in the lists are considered. This reduces complexity instead of creating a decision tree for: [["abbcc","addee"],["abbcc","affgg"],["ahhii","ajjkk"],["abbjj","allmm"]] === 1a. Convert to strings === If there are any numbers as items in ["abbcc","ahhii","abbjj"], they are converted to strings. === 2. Minimise strings === Find the first changed, then a different band of characters. abbcc ahhii abbjj b and h are the first changed characters. a bbcc a hhii a bbjj bbc, hhi and bbj are the last characters before the next characters stay the same. a bbc c a hhi i a bbj j The algorithms takes bbc hhi bbj If the number of characters above is greater or equal to 250, then skip over the rest of the algorithm and mind read, choosing from each whole option, rather than breaking the options into a decision tree and choosing one character at a time. Otherwise: === 3. Convert strings to decision tree === [[1,"b",2],[2,"b",3],[3,"c",[-,"bbc"]],[1,"b",5],[5,"b",6],[6,"j",[-,"bbj"]],[1,"h",8],[8,"h",9],[9,"i",[-,"hhi"]]] === 4. Merge decision tree branches === [[1,"b",2],[1,"h",8],[2,"b",3],[3,"c",[-,"bbc"]],[3,"j",[-,"bbj"]],[8,"h",9],[9,"i",[-,"hhi"]]] === 5. Shorten decision tree branches by deleting nodes with one child === [[1,"b",3],[3,"c",[-,"bbc"]],[3,"j",[-,"bbj"]],[1,"h",[-,"hhi"]]] === 6. Mind read the options from the origin of the decision tree, until reaching a terminal, i.e. === Options: b,h Choose: h The original string this choice corresponds to is found and the algorithm continues.
Summary:
Please note that all contributions to the Lucianpedia Wiki are considered to be released under the CC-BY-SA
Cancel
Editing help
(opens in new window)
Follow on IG
TikTok
Join Fan Lab