so here's my initial thought for objects (how do we make this classless? shit, that's gonna be tough)
entries for each person with:
to start with the classics:
age
sex(okay, gender(s); the old internet was shitty about that)
location (GPS down to... how many decimals? we only need within ~10 miles, but some might have multiple locations if people frequently travel for work, so allow multiple entries in this category)
preferred partner gender(s)
distance willing to travel
active/inactive flag
maybe a pic? no fuck that. a verification flag?
and an internal reference number, because names are sketchy AF and we need some way to sort this internally even with duplicate names. only usernames would be required, and that for notification/login.
so we grab all our objects people and check for proximity to person 0001
then exclude all who don't match person 0001's pref genders
then exclude all who don't like at least one of person 0001's inhabited genders
then choose from within that all whose (age=>(person0001's age/2+7)=true) AND (age=< (person001'sage*2+7)=true)
then display possible matches.
then poly people must solve travelling salesman (wait, shit. how long does sex between these two arbitrary people take? do we account for cuddling? public transit schedules? off road vehicles? teledildonics(and then network topology?)? UAV's?) for all possible matches in our regions before we could contact any of them. mono people need to flag themselves as active/inactive and also be super depressing or they get kicked off.
"In this paper we present a novel optimization algorithm inspired by the want of horny chapos to fuck during a pandemic, and their emergent self-organizing properties in such a context. The algorithm is denoted Chapos Choosing Partners (CCP), and is applied to the horny traveling salespersons problem, the multi-agent variation of the NP-Hard and NP-Horny Don Quixote optimization problem, which is itself a variant of the NP-Hard traveling salesman problem."
only us poly folks need to solve travelling salesman. mono's are fine but they get banned if they're insufficiently boring or creepy (doesnt need to be both)
look if you don't, I will, and it will be bad. because I am a trash coder and a worse math doer.
deleted by creator
lol i doubt it.
deleted by creator
not even horny... well maybe a little. just have to. no longer optional.
deleted by creator
im very aware.
so which of us is doing this? because im a truly awful coder.
deleted by creator
so here's my initial thought for objects (how do we make this classless? shit, that's gonna be tough)
entries for each person with: to start with the classics:
age
sex(okay, gender(s); the old internet was shitty about that)
location (GPS down to... how many decimals? we only need within ~10 miles, but some might have multiple locations if people frequently travel for work, so allow multiple entries in this category)
preferred partner gender(s)
distance willing to travel
active/inactive flag
maybe a pic? no fuck that. a verification flag?
and an internal reference number, because names are sketchy AF and we need some way to sort this internally even with duplicate names. only usernames would be required, and that for notification/login.
so we grab all our
objectspeople and check for proximity to person 0001then exclude all who don't match person 0001's pref genders
then exclude all who don't like at least one of person 0001's inhabited genders
then choose from within that all whose (age=>(person0001's age/2+7)=true) AND (age=< (person001'sage*2+7)=true)
then display possible matches.
then poly people must solve travelling salesman (wait, shit. how long does sex between these two arbitrary people take? do we account for cuddling? public transit schedules? off road vehicles? teledildonics(and then network topology?)? UAV's?) for all possible matches in our regions before we could contact any of them. mono people need to flag themselves as active/inactive and also be super depressing or they get kicked off.
"In this paper we present a novel optimization algorithm inspired by the want of horny chapos to fuck during a pandemic, and their emergent self-organizing properties in such a context. The algorithm is denoted Chapos Choosing Partners (CCP), and is applied to the horny traveling salespersons problem, the multi-agent variation of the NP-Hard and NP-Horny Don Quixote optimization problem, which is itself a variant of the NP-Hard traveling salesman problem."
only us poly folks need to solve travelling salesman. mono's are fine but they get banned if they're insufficiently boring or creepy (doesnt need to be both)