diff --git a/src/cheats/PCCheatMenuCheatDatatypeCleanup.tw b/src/cheats/PCCheatMenuCheatDatatypeCleanup.tw
index 5f78ca87af81bba2e840704827e8dc9ee8fc1027..005c0e3a00652c292e405f25d89be27537382be0 100644
--- a/src/cheats/PCCheatMenuCheatDatatypeCleanup.tw
+++ b/src/cheats/PCCheatMenuCheatDatatypeCleanup.tw
@@ -71,6 +71,7 @@
You perform the dark rituals, pray to the dark gods, and sell your soul for the power to reshape your body and life at will. What a cheater!
<<set $PC = clone($tempSlave)>>
+<<run ibc.recalculate_id(-1)>>
<<run PCDatatypeCleanup()>>
<<set $upgradeMultiplierArcology = upgradeMultiplier('engineering')>>
<<set $upgradeMultiplierMedicine = upgradeMultiplier('medicine')>>
diff --git a/src/cheats/mod_EditChildCheatDatatypeCleanupNew.tw b/src/cheats/mod_EditChildCheatDatatypeCleanupNew.tw
index 9ac0b8c1f7773a1ede8b558f13872d319296675a..283f230b8ca21b397bc7728936812e07caf97b93 100644
--- a/src/cheats/mod_EditChildCheatDatatypeCleanupNew.tw
+++ b/src/cheats/mod_EditChildCheatDatatypeCleanupNew.tw
@@ -327,3 +327,4 @@ You perform the dark rituals, pray to the dark gods, and sell your soul for the
<<if def _escn>>
<<set $cribs[_escn] = clone($activeSlave)>>
<</if>>
+<<run ibc.recalculate_coeff_id($activeSlave.ID)>>
diff --git a/src/cheats/mod_EditSlaveCheatDatatypeCleanup.tw b/src/cheats/mod_EditSlaveCheatDatatypeCleanup.tw
index 259d748bfbaa74c177b5e2c72ed4ca88aa5e50b6..015bbf3689f12cfe7aa5def560e7729c99d46c73 100644
--- a/src/cheats/mod_EditSlaveCheatDatatypeCleanup.tw
+++ b/src/cheats/mod_EditSlaveCheatDatatypeCleanup.tw
@@ -71,3 +71,4 @@ You perform the dark rituals, pray to the dark gods, and sell your soul for the
<<if def _escdc>>
<<set $slaves[_escdc] = $activeSlave>>
<</if>>
+<<run ibc.recalculate_coeff_id($activeSlave.ID)>>
diff --git a/src/cheats/mod_EditSlaveCheatDatatypeCleanupNew.tw b/src/cheats/mod_EditSlaveCheatDatatypeCleanupNew.tw
index 3dd6e0e84971868e55ea3238e7bfc1ec30e46916..043d863a43e53d02bd68d7404ded8b01fa599212 100644
--- a/src/cheats/mod_EditSlaveCheatDatatypeCleanupNew.tw
+++ b/src/cheats/mod_EditSlaveCheatDatatypeCleanupNew.tw
@@ -230,3 +230,4 @@ You perform the dark rituals, pray to the dark gods, and sell your soul for the
<<if def _escn>>
<<set $slaves[_escn] = clone($activeSlave)>>
<</if>>
+<<run ibc.recalculate_coeff_id($activeSlave.ID)>>
diff --git a/src/data/backwardsCompatibility/backwardsCompatibility.js b/src/data/backwardsCompatibility/backwardsCompatibility.js
index 1f363899aad581df334ee92a38945035cb410b59..e595875d8c85665ffc837754889a2a6187195cef 100644
--- a/src/data/backwardsCompatibility/backwardsCompatibility.js
+++ b/src/data/backwardsCompatibility/backwardsCompatibility.js
@@ -1258,6 +1258,7 @@ App.Update.slaveRecords = function(node) {
child.spermY = normalRandInt(50, 5);
}
App.Facilities.Nursery.InfantDatatypeCleanup(child);
+ child.inbreedingCoeff = ibc.coeff(child);
} else {
App.Update.Slave(child);
App.Entity.Utils.SlaveDataSchemeCleanup(child, true);
@@ -1280,6 +1281,17 @@ App.Update.slaveRecords = function(node) {
};
App.Update.genePoolRecords = function(node) {
+ Object.values(V.missingTable).forEach(s => {
+ if (!jsDef(s.mother))
+ s.mother = 0;
+ if (!jsDef(s.father))
+ s.father = 0;
+ if (!jsDef(s.inbreedingCoeff))
+ s.inbreedingCoeff = 0;
+ });
+
+ let ib_coeff = ibc.coeff_slaves(V.genePool);
+ V.genePool.forEach(g => {g.inbreedingCoeff = ib_coeff[g.ID]});
V.slaveIndices = slaves2indices(); // we're going to need to compare to active slaves, if they exist
for (let bci = 0; bci < V.genePool.length; bci++) {
diff --git a/src/data/backwardsCompatibility/updateSlaveObject.js b/src/data/backwardsCompatibility/updateSlaveObject.js
index aecfcbe7fa6955dd6bcd935feeccb640287555e0..af4d2a0f912cce2c041bb8905211d3c6ec82020f 100644
--- a/src/data/backwardsCompatibility/updateSlaveObject.js
+++ b/src/data/backwardsCompatibility/updateSlaveObject.js
@@ -1026,4 +1026,14 @@ App.Update.Slave = function(slave, genepool = false) {
}
}
}
+
+ if (!jsDef(slave.inbreedingCoeff)) {
+ slave.inbreedingCoeff = ibc.coeff(slave);
+ slave.womb.forEach(f => {
+ // Use null as the ID, since fetuses are missing it
+ f.genetics.inbreedingCoeff = ibc.coeff(
+ {ID: null, mother: f.genetics.mother, father: f.genetics.father}
+ );
+ });
+ }
};
diff --git a/src/data/newGamePlus.js b/src/data/newGamePlus.js
index f5a569ea612662e0a39f428dcde935087e67530a..bc771401033f017391fc9c69d2c3dc11f1b9476f 100644
--- a/src/data/newGamePlus.js
+++ b/src/data/newGamePlus.js
@@ -69,18 +69,77 @@ App.Data.NewGamePlus = (function() {
const ngUpdateMissingTable = function(missingTable) {
const newTable = {};
+ let needed = [];
(V.slaves || [])
.forEach(s => ([s.pregSource + NGPOffset, s.mother + NGPOffset, s.father + NGPOffset]
.filter(i => (i in missingTable))
.forEach(i => {
- newTable[i - NGPOffset] = missingTable[i];
- newTable[i - NGPOffset].ID -= NGPOffset;
+ if (needed.indexOf(i) === -1)
+ needed.push(i);
})));
+ (V.slaves || []).forEach(s => (s.womb
+ .forEach(f => ([f.fatherID, f.genetics.father, f.genetics.mother]
+ .filter(i => (i in missingTable))
+ .forEach(i => {
+ if (needed.indexOf(i) === -1)
+ needed.push(i);
+ })))));
+
+ while (needed.length > 0) {
+ let i = needed.shift();
+ let s = missingTable[i];
+ newTable[i - NGPOffset] = s;
+ s.ID -= NGPOffset;
+ if (s.mother in missingTable) {
+ s.mother -= NGPOffset;
+ if (!(s.mother in newTable) && needed.indexOf(s.mother + NGPOffset) === -1)
+ needed.push(s.mother + NGPOffset);
+ }
+ if (s.father in missingTable) {
+ s.father -= NGPOffset;
+ if (!(s.father in newTable) && needed.indexOf(s.father + NGPOffset) === -1)
+ needed.push(s.father + NGPOffset);
+ }
+ }
return newTable;
};
+ if (typeof V.missingTable !== undefined) {
+ let oldMissingParentID = Math.min(-10000, ...Object.keys(V.missingTable)) - 1;
+ V.slaves.filter(s => (s.assignment !== Job.IMPORTED)).forEach(s => {
+ V.missingTable[oldMissingParentID] = {
+ slaveName: s.slaveName,
+ slaveSurname: s.slaveSurname,
+ fullName: SlaveFullName(s),
+ dick: s.dick,
+ vagina: s.vagina,
+ ID: oldMissingParentID,
+ mother: s.mother,
+ father: s.father,
+ inbreedingCoeff: s.inbreedingCoeff
+ };
+ Object.values(V.missingTable).forEach(so => {
+ if (so.mother === s.ID)
+ so.mother = oldMissingParentID;
+ if (so.father === s.ID)
+ so.father = oldMissingParentID;
+ });
+ V.slaves.concat([V.PC]).forEach(so => {
+ if (so.mother === s.ID)
+ so.mother = oldMissingParentID;
+ if (so.father === s.ID)
+ so.father = oldMissingParentID;
+ if (so.assignment === Job.IMPORTED || so.ID === -1) {
+ WombChangeID(so, s.ID, oldMissingParentID);
+ WombChangeGeneID(so, s.ID, oldMissingParentID);
+ }
+ });
+ oldMissingParentID--;
+ });
+ }
+
V.slaves.deleteWith((s) => s.assignment !== Job.IMPORTED);
for (let slave of V.slaves) {
@@ -117,11 +176,7 @@ App.Data.NewGamePlus = (function() {
slave.relationshipTarget = slaveOrZero(slave.relationshipTarget);
}
V.genePool = ngUpdateGenePool(V.genePool);
- if (typeof V.missingTable === undefined || V.showMissingSlaves === false) {
- V.missingTable = {};
- } else {
- V.missingTable = ngUpdateMissingTable(V.missingTable);
- }
+ V.missingTable = ngUpdateMissingTable(V.missingTable);
let validRelationship = (s) => (s.relationshipTarget !== 0 && getSlave(s.relationshipTarget).relationshipTarget === s.ID);
for (let slave of V.slaves) {
if ((slave.relationship < 0 && V.freshPC === 1) || (slave.relationship > 0 && !validRelationship(slave))) {
diff --git a/src/descriptions/familySummaries.js b/src/descriptions/familySummaries.js
index 5db6e4def0c6fbc5cd77dd2e2f9e8758cd4d9c45..f962d0a076090a3469a5eaaa5bc7c7ab0ccff19d 100644
--- a/src/descriptions/familySummaries.js
+++ b/src/descriptions/familySummaries.js
@@ -490,6 +490,20 @@ App.Desc.family = (function() {
r.push(`${He} has ${numberWithPlural(slave.sisters, "sister")} and ${numberWithPlural(slave.daughters, "daughter")}.`);
}
+ if (V.inbreeding && slave.inbreedingCoeff > 0) {
+ r.push(`${He} is`);
+ if (slave.inbreedingCoeff >= 0.5)
+ r.push("extremely");
+ else if (slave.inbreedingCoeff >= 0.25)
+ r.push("very");
+ else if (slave.inbreedingCoeff >= 0.125);
+ else if (slave.inbreedingCoeff >= 0.0625)
+ r.push("somewhat");
+ else
+ r.push("slightly");
+ r.push(`inbred, with a CoI of ${slave.inbreedingCoeff}.`);
+ }
+
return r.join(" ");
}
@@ -675,6 +689,20 @@ App.Desc.family = (function() {
r.push(`<br>You have ${numberWithPlural(V.PC.sisters, "sister")} and ${numberWithPlural(V.PC.daughters, "daughter")}.`);
}
+ if (V.inbreeding && V.PC.inbreedingCoeff > 0) {
+ r.push(`You are`);
+ if (V.PC.inbreedingCoeff >= 0.5)
+ r.push("extremely");
+ else if (V.PC.inbreedingCoeff >= 0.25)
+ r.push("very");
+ else if (V.PC.inbreedingCoeff >= 0.125); // No adjective in this case
+ else if (V.PC.inbreedingCoeff >= 0.0625)
+ r.push("somewhat");
+ else
+ r.push("slightly");
+ r.push(`inbred, with a CoI of ${V.PC.inbreedingCoeff}.`);
+ }
+
return r.join(" ");
}
diff --git a/src/facilities/nursery/widgets/children/ChildState.js b/src/facilities/nursery/widgets/children/ChildState.js
index 8de31f2d3e8fb185dbe124bb6123328325e7dd3b..4adb08d4e2c425c7988eda3e9315ba5bc86acd24 100644
--- a/src/facilities/nursery/widgets/children/ChildState.js
+++ b/src/facilities/nursery/widgets/children/ChildState.js
@@ -1931,5 +1931,7 @@ App.Facilities.Nursery.ChildState = class ChildState {
this.lastWeeksRepIncome = 0;
/** Not currently used, will work similarly to the cash variables above */
this.lastWeeksRepExpenses = 0;
+ /** Slave's inbreeding coefficient */
+ this.inbreedingCoeff = 0;
}
};
diff --git a/src/facilities/nursery/widgets/infants/InfantState.js b/src/facilities/nursery/widgets/infants/InfantState.js
index f50c3506b54d851f0bbd744d250c0b8ab9f8644b..bad32d731988231611f9575cd12549d622658b95 100644
--- a/src/facilities/nursery/widgets/infants/InfantState.js
+++ b/src/facilities/nursery/widgets/infants/InfantState.js
@@ -187,5 +187,7 @@ App.Facilities.Nursery.InfantState = class InfantState {
this.spermY = 50;
/** how many weeks until the child is ready for release */
this.growTime = 156;
+ /** Slave's inbreeding coefficient */
+ this.inbreedingCoeff = 0;
}
};
diff --git a/src/gui/Encyclopedia/encyclopedia.tw b/src/gui/Encyclopedia/encyclopedia.tw
index 8140c9442d83218be401d606ebcb797e8e93eb15..61134d4fdcf1cfbf9c3ccfb1d257594439bc8ae6 100644
--- a/src/gui/Encyclopedia/encyclopedia.tw
+++ b/src/gui/Encyclopedia/encyclopedia.tw
@@ -3179,6 +3179,13 @@ MODS
What would a slaveowner be without the ability to customize their slaves' bodies? The Free Cities offer a variety of ways to achieve this for an arcology owner. Choose a more particular entry below:
<br>
+<<case "Inbreeding">>
+ At the intersection of incest and pregnancy lies inbreeding. As seen in royal families throughout history, high levels of inbreeding can result in severe issues, often manifesting as facial deformities or reduced intellectual capacity.
+
+ <br><br>One metric for quantifying inbreeding is the coefficient of inbreeding (CoI), which is the probability that both copies of a person's genes come from the same common ancestor. For example, without any previous inbreeding a child from self-fertilization has a CoI of 0.5, a child of two full siblings has a CoI of 0.25, and a child of two first cousins has a CoI of 0.0625.
+
+ <br><br>Enterprising breeders trying to breed specific traits should be mindful of the inbreeding coefficients of their stock: the higher the coefficient, the higher the chance that children will be slow or deformed.
+
<<default>>
Error: bad title.
<</switch>>
diff --git a/src/gui/Encyclopedia/encyclopediaRelatedLinks.tw b/src/gui/Encyclopedia/encyclopediaRelatedLinks.tw
index 977e489706c77724ea61c26500adbdee70b913f6..7fddb42e1033992d8e5f3ea2d6e8e22c61271a87 100644
--- a/src/gui/Encyclopedia/encyclopediaRelatedLinks.tw
+++ b/src/gui/Encyclopedia/encyclopediaRelatedLinks.tw
@@ -244,7 +244,7 @@ SLAVE RELATIONSHIPS
/**********
PREGNANCY
**********/
-<<case "Artificial Insemination" "Breeders Dietary Blend" "Childbirth and C-Secs" "Cloning" "Fertility Mix" "Gestation Drugs and Labor Suppressants" "Hyper-Pregnancy" "Ova Transplantation" "Player Pregnancy" "Pregnancy" "Pregnancy Generator" "Slave Fertility" "Super Fertility Drugs" "Surrogacy">>
+<<case "Artificial Insemination" "Breeders Dietary Blend" "Childbirth and C-Secs" "Cloning" "Fertility Mix" "Gestation Drugs and Labor Suppressants" "Hyper-Pregnancy" "Ova Transplantation" "Player Pregnancy" "Pregnancy" "Pregnancy Generator" "Slave Fertility" "Super Fertility Drugs" "Surrogacy" "Inbreeding">>
<<= App.Encyclopedia.Dialog.linkSC("Pregnancy", "Pregnancy")>>
| <<= App.Encyclopedia.Dialog.linkSC("Slave Fertility", "Slave Fertility")>>
| <<= App.Encyclopedia.Dialog.linkSC("Player Pregnancy", "Player Pregnancy")>>
@@ -261,6 +261,7 @@ PREGNANCY
| <<= App.Encyclopedia.Dialog.linkSC("Ova Transplantation", "Ova Transplantation")>>
| <<= App.Encyclopedia.Dialog.linkSC("Eugenics Breeding Proposal", "Eugenics Breeding Proposal")>>
| <<= App.Encyclopedia.Dialog.linkSC("Repopulationist Breeding School", "Repopulationist Breeding School")>>
+ | <<= App.Encyclopedia.Dialog.linkSC("Inbreeding", "Inbreeding")>>
/**********
INFLATION
diff --git a/src/js/SlaveState.js b/src/js/SlaveState.js
index 92f35f702d2f61f60101b8c11ff2fd131ffaa698..7a8469dc6fe4b89ee1e84105d53958106b3995ab 100644
--- a/src/js/SlaveState.js
+++ b/src/js/SlaveState.js
@@ -2507,6 +2507,8 @@ App.Entity.SlaveState = class SlaveState {
this.whoreClass = 0;
/** Maximum class for whore to target */
this.effectiveWhoreClass = 0;
+ /** Slave's inbreeding coefficient */
+ this.inbreedingCoeff = 0;
}
/** Creates an object suitable for setting nested attributes as it would be a SlaveState
diff --git a/src/js/ibcJS.js b/src/js/ibcJS.js
new file mode 100644
index 0000000000000000000000000000000000000000..d1e916f4d49a9fa50ca9343b1ad5b359142887a7
--- /dev/null
+++ b/src/js/ibcJS.js
@@ -0,0 +1,494 @@
+globalThis.ibc = (() => {
+ // These IDs are considered to be unknown parents
+ let or_null = (s) => specificCharacterID(s) ? s : null;
+
+ // Find some sort of state for a slave. Checks first the gene pool, then V.slaves, then the
+ // missing table
+ let find_gp = (id) => (slaveStateById(id) || V.genePool.find((s) => s.ID == id) || ((id in V.missingTable) ? V.missingTable[id] : null) || null);
+
+ // Create a node for the given ID
+ let create_node = (id) => ({
+ id: id, // Node ID
+ mother: null,
+ father: null,
+ nodecodes: [], // NodeCodes
+ nodecodes_str: [], // String version of the NodeCodes, for comparison
+ _coeff: null, // Cached CoI
+ child_count: 0 // Number of children of the node, for computing NodeCodes
+ });
+
+ // Determine the length of the shared prefix between the two NodeCode parameters
+ let prefix_len = (nca, ncb) => {
+ let i = 0;
+ for (i=0; i<Math.min(nca.length, ncb.length); i++) {
+ if (nca[i] !== ncb[i])
+ break;
+ }
+ return i;
+ };
+
+ // Determine the set of longest common prefixes for a node pair
+ let prefixes = (a, b) => {
+ let found = [];
+ let found_s = [];
+ a.nodecodes.forEach(nca => {
+ let match = false;
+ b.nodecodes.forEach(ncb => {
+ let l = prefix_len(nca, ncb);
+ if (l === 0 && match)
+ return;
+
+ if (l > 0) {
+ match = true;
+ let pfx = nca.slice(0,l);
+ let pfx_s = pfx.join(';');
+
+ if (!found_s.includes(pfx_s)) {
+ found_s.push(pfx_s);
+ found.push(pfx);
+ }
+ }
+ });
+ });
+
+ return found;
+ };
+
+ // Search up the tree to find a given NodeCode, starting at `n`
+ let find_nc = (nc, n) => {
+ if (n.nodecodes_str.includes(nc.join(';'))) {
+ return n;
+ }
+
+ let ret = null;
+ if (n.mother !== null)
+ ret = find_nc(nc, n.mother);
+ if (n.father !== null && ret === null)
+ ret = find_nc(nc, n.father);
+
+ return ret;
+ };
+
+ // Determine the set of common ancestors between a node pair
+ let common = (a, b) => {
+ let pfx = prefixes(a, b);
+ let pfx_s = pfx.map(s => s.join(';'));
+ let anc = [];
+
+ while (pfx.length > 0) {
+ let p = pfx.pop(0);
+ pfx_s.pop(0);
+ let ret = find_nc(p, a);
+
+ ret.nodecodes.forEach(nc => {
+ let i = pfx_s.indexOf(nc.join(';'));
+ if (i === -1)
+ return;
+
+ pfx.pop(i);
+ pfx_s.pop(i);
+ });
+
+ if (anc.findIndex(s => (s[0] == ret)) === -1)
+ anc.push([ret, p]);
+ }
+
+ return anc;
+ };
+
+ // Determine the set of NodeCodes on `n` with prefix `x`
+ let mps = (n, x) => {
+ let x_s = x.join(';');
+ return n.nodecodes.filter(nc => (nc.slice(0, x.length).join(';') === x_s));
+ };
+
+ // Compute the set of all paths to the parents of `n` with prefix `x`
+ let pp = (mother, father, x) => {
+ let m = mps(mother, x);
+ let f = mps(father, x);
+
+ let prod = [];
+ m.forEach(i => {
+ f.forEach(j => {
+ prod.push([i, j]);
+ });
+ });
+
+ return prod;
+ };
+
+ let kinship = (mother, father) => {
+ let _coeff = 0;
+ if (mother === null || father === null)
+ _coeff = 0;
+ else if (mother == father)
+ _coeff = 0.5 * (1 + coeff(mother));
+ else {
+ let cf = 0;
+ let cmn = common(mother, father);
+
+ cmn.forEach(el => {
+ let c = el[0];
+ let p = el[1];
+ let p_s = p.join(';');
+
+ let paths = pp(mother, father, p);
+ let paths_s = paths.map(p => [p[0].join(';'), p[1].join(';')].join(','));
+
+ cmn.forEach(el2 => {
+ let co = el2[0];
+ if (co == c)
+ return;
+ let found = [];
+ let m_pp = [];
+ let f_pp = [];
+
+ co.nodecodes.forEach(nc => {
+ if (nc.slice(0, p.length).join(';') != p_s)
+ return;
+
+ m_pp = m_pp.concat(mps(mother, nc));
+ f_pp = f_pp.concat(mps(father, nc));
+ });
+
+ m_pp.forEach(mp => {
+ f_pp.forEach(fp => {
+ let mf_s = [mp.join(';'), fp.join(';')].join(',');
+ let i = paths_s.indexOf(mf_s);
+ if (i === -1)
+ return;
+ paths_s.pop(i);
+ paths.pop(i);
+ });
+ });
+ });
+ paths.forEach(p => {
+ let pfx = prefix_len(p[0], p[1]);
+
+ cf += 0.5**(p[0].length + p[1].length+1 - 2*pfx) * (1 + coeff(c));
+ });
+ });
+
+ _coeff = cf;
+ }
+
+ return _coeff;
+ };
+
+ // Determine the coefficient of inbreeding of a node `n`
+ let coeff = n => {
+ if (n._coeff === null)
+ n._coeff = kinship(n.mother, n.father);
+ return n._coeff;
+ };
+
+ // Populate the NodeCodes.
+ //
+ // Each node has a set of NodeCodes, which represent the set of paths from it to its ancestors.
+ // NodeCodes here are represented by arrays of integers.
+ //
+ // NodeCodes are constructed recursively in this fashion:
+ //
+ // - Assign each of the founders (nodes with both parents === null) an unique ID, starting from
+ // 0 and incrementing each time (the order doesn't matter); a founder's set of NodeCodes has
+ // exactly one NodeCode, which is [ID] (an array containing only their ID)
+ //
+ // - For each other node, let M be its child number w.r.t. its mother and N its child number
+ // w.r.t. its father, i.e. the number of children that the respective parent has had before
+ // this one (the order is not important to the algorithm, it's arbitrary here for
+ // convenience). Its set of NodeCodes is the set of all its mother's NodeCodes with M appended
+ // and all of its father's NodeCodes with N appended. For example, if its mother has the
+ // NodeCodes [[2]] and M = 3 and its father has the NodeCodes [[0,1], [3,1]] and N = 1 then
+ // the set of NodeCodes for this node would be
+ //
+ // [[2, 3], [0, 1, 1], [3, 1, 1]]
+ //
+ // We do this iteratively here, looping over the set of all nodes until each has been assigned
+ // a NodeCode. This requires looping through a number of times equal to the number of
+ // generations, since as soon as both parents have NodeCodes their children's NodeCodes may be
+ // computed.
+ let make_nc = nodes => {
+ // Generate founder NodeCodes
+ let total = Object.keys(nodes).length;
+ let seen = [];
+ let curid = 0;
+ Object.values(nodes).forEach(n => {
+ if (n.mother !== null || n.father !== null)
+ return;
+ n.nodecodes.push([curid]);
+ curid += 1;
+ seen.push(n.id);
+ });
+
+ // Generate the rest of the NodeCodes
+ while (seen.length != total) {
+ Object.keys(nodes).forEach(s=> {
+ let n = nodes[s];
+ if (seen.includes(+s)) // We've already done this
+ return;
+ else if ((n.mother !== null && n.mother.nodecodes.length === 0) || (n.father !== null && n.father.nodecodes.length === 0)) // Too soon, we haven't done its parents
+ return;
+
+ seen.push(n.id);
+ // Compute the NodeCodes from its parents
+ [n.mother, n.father].forEach((a, i) => {
+ if (a === null || (n.mother === n.father && i == 1)) // Ignore missing parents/repeated
+ return;
+
+ a.nodecodes.forEach(nc => {
+ // Copy the NodeCode, push the child number, then add it
+ let nnc = nc.slice();
+ nnc.push(a.child_count);
+ n.nodecodes.push(nnc);
+ });
+ a.child_count += 1;
+ });
+
+ // NodeCodes must be sorted; this suffices
+ n.nodecodes.sort()
+ });
+ }
+
+ // Cache the string NodeCodes
+ Object.values(nodes).forEach(n => {
+ n.nodecodes_str = n.nodecodes.map(nc => nc.join(';'));
+ });
+ };
+
+ // Make nodes for an array of slaves
+ let nodes_slaves = (slaves, ignore_coeffs=false) => {
+ let nodes = {};
+
+ // Recursively create the nodes we need, moving upwards from the given slave
+ let create_node_rec = s => {
+ // Certain parents (e.g. 0, societal elite) are not considered to be related, despite
+ // having the same ID; convert them to null
+ let m = or_null(s.mother);
+ let f = or_null(s.father);
+
+ // Ensure that parent nodes are created
+ [m, f].forEach(p => {
+ if (p !== null && !(p in nodes)) { // Not created, we have to do something
+ if (p === -1) {
+ create_node_rec(SugarCube.State.variables.PC);
+ } else {
+ // Search for a slave state, genePool entry, or missingTable entry
+ let gp = find_gp(p);
+ if (gp !== null) {
+ // If we find one, we might have ancestry information: recurse
+ create_node_rec(gp);
+ } else {
+ // Otherwise, just create a plain node
+ nodes[p] = create_node(p);
+ }
+ }
+ }
+ });
+
+ if (!(s.ID in nodes)) // Create this node if necessary
+ nodes[s.ID] = create_node(s.ID);
+ // We created its parents earlier, so set them to the actual nodes
+ nodes[s.ID].mother = (m === null) ? m : nodes[m];
+ nodes[s.ID].father = (f === null) ? f : nodes[f];
+
+ // Try to use a cached CoI for performance
+ let sg = find_gp(s.ID);
+ if (!ignore_coeffs && sg !== null && "inbreedingCoeff" in sg && sg.inbreedingCoeff !== -1) {
+ nodes[s.ID]._coeff = sg.inbreedingCoeff;
+ }
+ };
+
+ // Populate the nodes
+ slaves.forEach(s=> create_node_rec(s));
+
+ // Populate NodeCodes
+ make_nc(nodes);
+
+ return nodes;
+ }
+
+ // Determine the coefficients of inbreeding of an array of slaves. Returns a mapping of their
+ // ID to their coefficient of inbreeding
+ let coeff_slaves = (slaves, ignore_coeffs=false) => {
+ let ret = {};
+ // First, pull as many existing CoI off the slaves
+ slaves.forEach(s => {
+ let sg = find_gp(s.ID);
+ if (!ignore_coeffs && sg !== null && "inbreedingCoeff" in sg && sg.inbreedingCoeff !== -1) {
+ ret[s.ID] = sg.inbreedingCoeff;
+ }
+ });
+
+ // Now do any we haven't done already
+ slaves = slaves.filter(s => (!(s.ID in ret)));
+ if (slaves.length > 0) {
+ let nodes = nodes_slaves(slaves, ignore_coeffs);
+
+ // Compute coefficients
+ slaves.forEach(s => {
+ ret[s.ID] = coeff(nodes[s.ID]);
+ });
+ }
+
+ return ret;
+ };
+
+ // Determine the kinship between two slaves `a` and `b`
+ let kinship_slaves = (a, b, ignore_coeffs=false) => {
+ if (a === 0 || b === 0)
+ return 0;
+
+ return kinship_one_many(a, [b], ignore_coeffs)[b.ID];
+ };
+
+ // Determine the coefficient of inbreeding of a single slave
+ let coeff_slave = (slave, ignore_coeffs=false) => {
+ if (!ignore_coeffs && "inbreedingCoeff" in slave && slave.inbreedingCoeff !== -1)
+ return slave.inbreedingCoeff;
+
+ let gp = find_gp(slave.ID);
+ if (!ignore_coeffs && gp !== null && "inbreedingCoeff" in gp && gp.inbreedingCoeff !== -1)
+ return gp.inbreedingCoeff;
+
+ return coeff_slaves([slave], ignore_coeffs)[slave.ID];
+ };
+
+ // Determine the kinship between one and many slaves. Returns an mapping from the ID of each of
+ // the slaves in `others` to its kinship with slave `a`
+ let kinship_one_many = (a, others, ignore_coeffs=false) => {
+ if (a === 0) {
+ let ks = {};
+ others.forEach(s => {
+ if (s === 0)
+ ks[s] = 0;
+ else
+ ks[s.ID] = 0;
+ });
+ return ks;
+ }
+
+ let nodes = nodes_slaves(others.concat([a]), ignore_coeffs);
+
+ let ks = {};
+ others.forEach(s => {
+ if (s === -3) {
+ // Fake a slave object for the player's old master
+ s = {ID: -3, mother: 0, father: 0, inbreedingCoeff: 0};
+ }
+
+ if (s === 0)
+ ks[s] = 0;
+ else
+ ks[s.ID] = kinship(nodes[a.ID], nodes[s.ID]);
+ });
+
+ return ks;
+ };
+
+ // Recalculate the inbreeding coefficient for all slaves dependent on the passed IDs (e.g. the
+ // slaves themselves and all of their children). This will replace the inbreeding coefficients
+ // wherever they exist with the computed values, ignoring all cached values.
+ //
+ // This should be called if parents are changed.
+ let recalculate_coeff_ids = (ids) => {
+ // These are all the slave-like objects, i.e. they have ID, mother, and father. There will
+ // be multiple elements with the same ID: we want this, since we have to replace all
+ // occurrences of the COI for the affected slaves
+ let all_slave_like = V.slaves.concat(V.genePool).concat(V.cribs).concat(V.tanks).concat(Object.values(V.missingTable));
+ if (V.boomerangSlave !== 0)
+ all_slave_like.push(V.boomerangSlave);
+ if (V.traitor !== 0)
+ all_slave_like.push(V.traitor);
+ if (V.activeSlave !== 0)
+ all_slave_like.push(V.activeSlave);
+ all_slave_like.push(V.PC);
+ // Add a fake entry for the PC's old master
+ all_slave_like.push({ID: -3, mother: 0, father: 0, inbreedingCoeff: 0});
+
+ // Gather the genetics of all current fetuses
+ let all_fetuses = V.slaves.filter(s => s.preg > 0).map(s => s.womb.map(i => i.genetics)).reduce((res, cur) => res.concat(cur), []);
+
+ // Recursively find all of the given ID's children, born and unborn
+ let find_children_rec = (id, cur_slaves, cur_fetuses, cur_fetus_parents) => {
+ // Add fetuses
+ all_fetuses.filter(f => (f.father === id || f.mother === id)).forEach(f => {
+ // We may have to manually add the parents later
+ let actual_f = or_null(f.father);
+ let actual_m = or_null(f.mother);
+ if (actual_f !== null)
+ cur_fetus_parents.add(actual_f);
+ if (actual_m !== null)
+ cur_fetus_parents.add(actual_m);
+
+ cur_fetuses.add(f);
+ });
+
+ // Recursively add slaves
+ all_slave_like.filter(s => (s.father === id || s.mother === id)).forEach(s => {
+ if (!cur_slaves.has(s.ID)) {
+ cur_slaves.add(s.ID);
+ find_children_rec(s.ID, cur_slaves, cur_fetuses, cur_fetus_parents);
+ }
+ });
+ };
+
+ // We only need slave IDs, since we have to update all of their entries (including GP)
+ let needed_slave_ids = new Set();
+ // Since each fetus has a unique record, a set still suffices
+ let needed_fetuses = new Set();
+ let needed_parent_ids = new Set();
+
+ // Find all the children of the IDs we need to do
+ ids.forEach(id => {
+ needed_slave_ids.add(id);
+ find_children_rec(id, needed_slave_ids, needed_fetuses, needed_parent_ids);
+ });
+
+ // Now we assemble the tree from the slaves
+ let needed_slaves = [];
+ needed_slave_ids.forEach(id => {
+ if (typeof id !== "undefined")
+ needed_slaves.push(all_slave_like.find(s => s.ID === id));
+ });
+ needed_parent_ids.forEach(id => {
+ if (typeof id !== "undefined" && !needed_slave_ids.has(id))
+ needed_slaves.push(all_slave_like.find(s => s.ID == id));
+ });
+ let nodes = nodes_slaves(needed_slaves, true);
+
+ // Now calculate the inbreeding coefficients (they're cached in the tree once calculated)
+ all_slave_like.filter(s => needed_slave_ids.has(s.ID)).forEach(s => {
+ s.inbreedingCoeff = coeff(nodes[s.ID]);
+ });
+
+ // Finally, handle all of the kinship for the fetuses
+ let kinship_cache = new Map(); // Manually cache it
+ needed_fetuses.forEach(f => {
+ if (or_null(f.mother) === null || or_null(f.father) === null) {
+ f.inbreedingCoeff = 0;
+ return;
+ }
+
+ // Use a string of the form "parent;parent" to store the cache value; since kinship is
+ // commutative, the minumum parent ID will be first
+ let kinship_str = Math.min(f.mother, f.father) + ';' + Math.max(f.mother, f.father);
+ if (!kinship_cache.has(kinship_str))
+ kinship_cache.set(kinship_str, kinship(nodes[f.mother], nodes[f.father]));
+
+ f.inbreedingCoeff = kinship_cache.get(kinship_str);
+ });
+ };
+
+ let recalculate_coeff_id = (id) => {
+ return recalculate_coeff_ids([id]);
+ };
+
+ return {
+ coeff: coeff_slave,
+ coeff_slaves,
+ kinship: kinship_slaves,
+ kinship_one_many,
+ recalculate_coeff_ids,
+ recalculate_coeff_id
+ };
+})();
diff --git a/src/js/removeActiveSlave.js b/src/js/removeActiveSlave.js
index 95ea18e2bda23cc26107f1a28c8f14fe641dbe28..eb32e2872f8dede7976205ae5c0deca11ca5f9c8 100644
--- a/src/js/removeActiveSlave.js
+++ b/src/js/removeActiveSlave.js
@@ -197,6 +197,10 @@ globalThis.removeActiveSlave = function() {
V.genePool.deleteAt(_geneIndex);
}
}
+ Object.values(V.missingTable).forEach(s => {
+ if (s.mother === V.activeSlave.ID || s.father === V.activeSlave.ID)
+ missing = true;
+ });
if (missing) {
V.missingTable[V.missingParentID] = {
slaveName: V.activeSlave.slaveName,
@@ -204,7 +208,10 @@ globalThis.removeActiveSlave = function() {
fullName: SlaveFullName(V.activeSlave),
dick: V.activeSlave.dick,
vagina: V.activeSlave.vagina,
- ID: V.missingParentID
+ ID: V.missingParentID,
+ mother: V.activeSlave.mother,
+ father: V.activeSlave.father,
+ inbreedingCoeff: V.activeSlave.inbreedingCoeff
};
if (V.traitor.ID === V.activeSlave.ID) {
/* To link developing fetuses to their parent */
@@ -212,6 +219,12 @@ globalThis.removeActiveSlave = function() {
} else if (V.boomerangSlave.ID === V.activeSlave.ID) {
V.boomerangSlave.missingParentTag = V.missingParentID;
}
+ Object.values(V.missingTable).forEach(s => {
+ if (s.mother === V.activeSlave.ID)
+ s.mother = V.missingParentID;
+ if (s.father === V.activeSlave.ID)
+ s.father = V.missingParentID;
+ });
V.missingParentID--;
}
@@ -310,6 +323,10 @@ globalThis.removeNonNGPSlave = function(removedSlave) {
V.genePool.deleteAt(_geneIndex);
}
}
+ Object.values(V.missingTable).forEach(s => {
+ if (s.mother == removedSlave.ID || s.father == removedSlave.ID)
+ missing = true;
+ });
if (missing) {
V.missingTable[V.missingParentID] = {
slaveName: removedSlave.slaveName,
@@ -317,8 +334,17 @@ globalThis.removeNonNGPSlave = function(removedSlave) {
fullName: SlaveFullName(removedSlave),
dick: removedSlave.dick,
vagina: removedSlave.vagina,
- ID: V.missingParentID
+ ID: V.missingParentID,
+ mother: removedSlave.mother,
+ father: removedSlave.father,
+ inbreedingCoeff: removedSlave.inbreedingCoeff
};
+ Object.values(V.missingTable).forEach(s => {
+ if (s.mother === removedSlave.ID)
+ s.mother = V.missingParentID;
+ if (s.father === removedSlave.ID)
+ s.father = V.missingParentID;
+ });
V.missingParentID--;
}
diff --git a/src/js/wombJS.js b/src/js/wombJS.js
index e560f361fc5fd2203a9f1c90ca2f05c82b345c3d..2cdf98b6a0ff14da877cc76498f9ba6f798a83f0 100644
--- a/src/js/wombJS.js
+++ b/src/js/wombJS.js
@@ -94,6 +94,14 @@ globalThis.WombInit = function(actor) {
WombImpregnate(actor, bLeft, actor.pregSource, i + 1); // setting up leftover of fetuses.
}
}
+
+ actor.womb.forEach(f => {
+ if (!jsDef(f.genetics.inbreedingCoeff)) {
+ f.genetics.inbreedingCoeff = ibc.coeff(
+ {ID: null, mother: f.genetics.mother, father: f.genetics.father}
+ );
+ }
+ });
};
globalThis.WombImpregnate = function(actor, fCount, fatherID, age, surrogate) {
diff --git a/src/npc/acquisition.tw b/src/npc/acquisition.tw
index ebb7ec3198702510af01eb6f78bb89c73570b508..59d74203b7f14caa28fdeefecbd4318be3e3abd2 100644
--- a/src/npc/acquisition.tw
+++ b/src/npc/acquisition.tw
@@ -178,6 +178,23 @@
<<set $missingParentID-->>
<</if>>
<</for>>
+<<set _coeffSlaves = []>>
+<<set _genePoolMap = {}>>
+<<for _i = 0; _i < $genePool.length; _i++>>
+ <<set _genePoolMap[$genePool[_i].ID] = $genePool[_i]>>
+<</for>>
+<<for _i = 0; _i < $slaves.length; _i++>>
+ <<if $slaves[_i].newGamePlus == 0>>
+ <<set $slaves[_i].inbreedingCoeff = -1>>
+ <<set _genePoolMap[$slaves[_i].ID].inbreedingCoeff = -1>>
+ <<run _coeffSlaves.push($slaves[_i])>>
+ <</if>>
+<</for>>
+<<set _ibcoeffs = ibc.coeff_slaves(_coeffSlaves)>>
+<<for _i = 0; _i < _coeffSlaves.length; _i++>>
+ <<set _coeffSlaves[_i].inbreedingCoeff = _ibcoeffs[_coeffSlaves[_i].ID]>>
+ <<set _genePoolMap[_coeffSlaves[_i].ID].inbreedingCoeff = _ibcoeffs[_coeffSlaves[_i].ID]>>
+<</for>>
<<if $plot == 1 && $neighboringArcologies > 0>>
<<set _bestProsperity = 0, _bestProsperityIndex = 1>>
<<for _acq = 1; _acq < $arcologies.length; _acq++>>
diff --git a/src/npc/generate/generateGenetics.js b/src/npc/generate/generateGenetics.js
index 431f2c1aac1cc0e9f49dc93f1a293f5f57910a68..8e119e198680560dd547a20b25a3da46e4c205ec 100644
--- a/src/npc/generate/generateGenetics.js
+++ b/src/npc/generate/generateGenetics.js
@@ -97,12 +97,13 @@ globalThis.generateGenetics = (function() {
genes.motherName = setMotherName(activeMother);
genes.father = setFatherID(actor2);
genes.fatherName = setFatherName(father, activeFather, actor2);
+ genes.inbreedingCoeff = ibc.kinship(mother, father);
genes.nationality = setNationality(father, mother);
genes.geneticQuirks = setGeneticQuirks(activeFather, activeMother, genes.gender);
genes.skin = setSkin(father, mother, actor2);
genes.race = setRace(father, mother, actor2);
- genes.intelligence = setIntelligence(father, mother, activeMother, actor2);
- genes.face = setFace(father, mother, activeMother, actor2, genes.geneticQuirks);
+ genes.intelligence = setIntelligence(father, mother, activeMother, actor2, genes.inbreedingCoeff);
+ genes.face = setFace(father, mother, activeMother, actor2, genes.geneticQuirks, genes.inbreedingCoeff);
genes.faceShape = setFaceShape(father, mother, genes.geneticQuirks);
genes.eyeColor = setEyeColor(father, mother, actor2);
if (genes.geneticQuirks.heterochromia === 2) {
@@ -592,7 +593,7 @@ globalThis.generateGenetics = (function() {
}
// intelligence
- function setIntelligence(father, mother, activeMother, actor2) {
+ function setIntelligence(father, mother, activeMother, actor2, inbreedingCoeff) {
let smarts;
if (mother.ID === -1) {
if (actor2 === -6) {
@@ -616,29 +617,15 @@ globalThis.generateGenetics = (function() {
smarts = mother.intelligence;
}
if (V.inbreeding === 1) {
- if (mother.ID !== -1) {
- if (father !== 0 && father.ID === -1 && activeMother.breedingMark !== 1) {
- if (smarts >= -95 && jsRandom(1, 100) < 40) {
- smarts -= jsRandom(1, 10);
- if (smarts >= -95 && jsRandom(1, 100) < 20) {
- smarts -= jsRandom(1, 5);
- }
- }
- } else {
- if (smarts >= -95 && jsRandom(1, 100) < 50) {
- smarts -= jsRandom(1, 15);
- if (smarts >= -95 && jsRandom(1, 100) < 30) {
- smarts -= jsRandom(1, 15);
- }
- }
- }
+ if (jsRandom(1, 100) < inbreedingCoeff*200) {
+ smarts -= Math.abs(normalRandInt(5*inbreedingCoeff, 30*inbreedingCoeff, -100*inbreedingCoeff, 100*inbreedingCoeff));
}
}
return Math.clamp(smarts, -100, 100);
}
// face
- function setFace(father, mother, activeMother, actor2, genes) {
+ function setFace(father, mother, activeMother, actor2, genes, inbreedingCoeff) {
let face;
if (genes.pFace > 0 && genes.uFace > 0) {
face = 0;
@@ -668,19 +655,8 @@ globalThis.generateGenetics = (function() {
face = mother.face;
}
if (V.inbreeding === 1 && genes.pFace === 0 && genes.uFace === 0) {
- if (mother.ID !== -1) {
- if (father !== 0 && father.ID === -1 && activeMother.breedingMark !== 1) {
- if (face > -100 && jsRandom(1, 100) > 60) {
- face -= jsRandom(2, 20);
- }
- } else {
- if (face > -100 && jsRandom(1, 100) < 50) {
- face -= jsRandom(1, 15);
- if (face >= -95 && jsRandom(1, 100) < 30) {
- face -= jsRandom(5, 20);
- }
- }
- }
+ if (jsRandom(1, 100) < inbreedingCoeff*200) {
+ face -= Math.abs(normalRandInt(5*inbreedingCoeff, 35*inbreedingCoeff, -100*inbreedingCoeff, 100*inbreedingCoeff));
}
}
return Math.clamp(face, -100, 100);
@@ -1367,6 +1343,8 @@ globalThis.generateChild = function (mother, ovum, incubator=false) {
child.navelPiercing = 0;
}
+ child.inbreedingCoeff = genes.inbreedingCoeff;
+
generatePronouns(child);
return child;
diff --git a/src/npc/interaction/passage/fSlaveImpreg.tw b/src/npc/interaction/passage/fSlaveImpreg.tw
index efd9b39178182e8794ae0d2890019ccb074e2283..e81aeecbf96434e8e1bc6c62cf0954fde2b27012 100644
--- a/src/npc/interaction/passage/fSlaveImpreg.tw
+++ b/src/npc/interaction/passage/fSlaveImpreg.tw
@@ -10,6 +10,7 @@
<h3>Select an eligible slave to serve as the semen donatrix</h3>
<<set _eligibles = $slaves.filter((s) => (s.ID != getSlave($AS).ID) && canImpreg(getSlave($AS), s) && canPenetrate(s))>>
+<<set _kinship = ibc.kinship_one_many(getSlave($AS), _eligibles)>>
<<for _i = 0; _i < _eligibles.length; _i++>>
<<set _name = SlaveFullName(_eligibles[_i])>>
<div>
@@ -23,6 +24,21 @@
@@.lightgreen;<<= capFirstChar(_relTerm)>>@@
<</if>>
<</if>> /* closes extended family mode */
+ <<if $inbreeding && _kinship[_eligibles[_i].ID] > 0>>
+ <<set _thisKinship = _kinship[_eligibles[_i].ID]>>
+ <<if _thisKinship >= 0.5>>
+ (Extreme
+ <<elseif _thisKinship >= 0.25>>
+ (Major
+ <<elseif _thisKinship >= 0.125>>
+ (Some
+ <<elseif _thisKinship >= 0.0625>>
+ (Minor
+ <<else>>
+ (Slight
+ <</if>>
+ inbreeding, CoI of <<print _thisKinship>>)
+ <</if>>
</div>
<</for>>
<<if (_eligibles.length === 0)>>
diff --git a/src/player/js/PlayerState.js b/src/player/js/PlayerState.js
index 4efbdaf320adf2e8d164496d3c6f4216be6eab5f..fe3b61163ee21ecd9c20c22885b90b8f8fec363c 100644
--- a/src/player/js/PlayerState.js
+++ b/src/player/js/PlayerState.js
@@ -1991,6 +1991,8 @@ App.Entity.PlayerState = class PlayerState {
*
* 0: no; 1: yes */
this.staminaPills = 0;
+ /** Player's coefficient of inbreeding */
+ this.inbreedingCoeff = 0;
}
/** Creates an object suitable for setting nested attributes as it would be a SlaveState
diff --git a/src/pregmod/widgets/bodyswapWidgets.tw b/src/pregmod/widgets/bodyswapWidgets.tw
index ee9c226b664eca66be129389643e7659a3df1411..4a1ed4eeac6e86a66b17cdfda37e3e0ba63d4cd4 100644
--- a/src/pregmod/widgets/bodyswapWidgets.tw
+++ b/src/pregmod/widgets/bodyswapWidgets.tw
@@ -164,6 +164,7 @@
<<set $args[0].albinismOverride = $args[1].albinismOverride>>
<<set $args[0].clone = $args[1].clone>>
<<set $args[0].cloneID = $args[1].cloneID>>
+<<set $args[0].inbreedingCoeff = $args[1].inbreedingCoeff>>
<<set $args[0].canRecruit = 0>>