The Wiki for Tale 4 is in read-only mode and is available for archival and reference purposes only. Please visit the current Tale 11 Wiki in the meantime.
If you have any issues with this Wiki, please post in #wiki-editing on Discord or contact Brad in-game.
User:Inkoaten
Inkoaten
Home compound: Shabbat Ab 1240,1660 (near SWorship, southwest of the chariot)
Stats
STR 0 DEX 7 END 0 SPD 4 CON 0 FOC 0 PER 3
- Gastronomy: 8
- Beer Tasting: 23
- Fumeology: 42
Wiki
Mostly maintenance - restructuring pages, editorial cleanups, filling in missing info, etc. Trying to improve the wiki for those not intimately involved with the particular page in question by stating the obvious where it's not already stated!
Laws
Ongoing (futile?) attempt to construct a law that's (a) useful and (b) well thought out. Forum discussion post
Wines
I'm just beginning to get vineyards set up. Currently the only flavors I have are Hot Alcohol and Cherry. I have another 17 vineyards (spread out) that I'm doing state mapping for, so I should have some new flavors in a week or so.
I also have a few research vineyards up for the purpose of confirming/updating the wiki's tend tables.
Finally, I'm halfway through writing a little Java GA program that tries to find useful tend sequences (much like Winer, but I'm reinventing the wheel as usual). Currently it 'works', but you have to hack around with the initialization data and fitness functions by hand, and the fitness functions are a bit dubious. Planning to make it more configurable, and probably auto-import tends from the wiki eventually (via e.g. Special:Export/Wine/Appreciation. If you'd like a copy of the work in progress, get in touch.
| State \ Vine | Amusement | Appreciation | Balance | Contemplation | Wisdom |
|---|---|---|---|---|---|
| Sa | PO (-2) | MG (-1) | MG (-1) | MG (-1) | MG (-1) |
| W | TV (-3) | TL (-1) | TL (-1) | TL (-1) | TL (-1) |
| M | MG (-3) | MG (-3) | MG (-3) | MG (-3) | MG (-3) |
| F | SV (-1) | MG (-4) | MG (-4) | MG (-4) | MG (-4) |
| R | AS (-1) | SL (-2) | SL (-2) | SL (-2) | SL (-2) |
| Sv | TL (-2) | AS (-2) | AS (-2) | AS (-2) | AS (-2) |
| Sm | TL (-1) | SV (-3) | SV (-3) | SV (-3) | SV (-3) |
| Aggregate | A:+6 C:+10 G:+23 Q:-5 K:+1 S:+7 V:-13 |
A:-5 C:+2 G:+10 Q:+23 K:+1 S:-1 V:-16 |
A:-1 C:+16 G:+10 Q:+19 K:+11 S:+14 V:-16 |
A:-5 C:+2 G:+10 Q:-1 K:+34 S:-1 V:-16 |
A:-5 C:+2 G:+10 Q:+9 K:+13 S:-1 V:-16 |
(aggregate values are the total of all the minimum-vigor-loss tends - so divide by 7 and that's roughly the average change in stats per tend - ignoring the case of stats that go below 0)
Public Mines
Drama!
There was some discussion on SA regional chat about setting up a semi-public guild that just holds mines and enforces a "you break it, you repair it" rule. Sounds promising.
Gemcutting
It should be possible to write software that, given a gem configuration, tells you all possible gems that can be cut from it:
- Gems are a 7x7x7 cube of points. Each point is either present or absent.
- Edges, triangles, and squares are generated to join adjacent (orthogonal or diagonal) points that are present. e.g. eyelet looks like this (X=present .=absent), as a series of slices through the gem:
XXX XXX X.X X.X XXX XXX
Or with edges added for clarity:
X-X-X X-X-X |/ \| |/ \| X . X X . X |\ /| |\ /| X-X-X X-X-X
- The grinding discs then turn into a fairly simple set of rules for removing vertexes from the array of points. e.g. disc 1 will remove an entire plane from any one edge; disc 2 removes a triangular prism of points aligned with one axis.
- For each potential gem, reduce its structure down to the minimum necessary set of present/absent points (by looking for applications of a disc that will only affect "absent" points - flag all those points as "don't care" points because either they are already absent, or they are present but can be safely grinded away). e.g. eyelet stays exactly as above (you can remove anything around it with disc 1, but you need the core structure exactly as above), and Dragyn's Eye looks like this: (?="don't care" i.e. can be removed safely without clobbering the important bits):
???X ???? ???? ???? ??XX ???X ???? ???? ?XXX ??.. ???X ???? XXXX ?X.X ??XX ???X
This can be done by hand, once. More generally, represent the possible grinding planes and depths as (A,B,C,D) tuples where all points that satisfy Ax+By+Cz+D < 0 are ground away; then apply all planes where the plane would remove only absent points. (A,B,C is the plane normal vector). Done, just needs gems fed into it.
- By eye, or via image processing of screenshots, construct the vertex map for a newly loaded gem. (This is a tedious process to do by eye, but it's do-able. Image processing is a better bet)
- Rotate the vertex map through the 24 possible orientations (4 rotations around each of 6 faces)
- For each orientation, scan the vertex map using the gem patterns prepared earlier. If you find a match, that gem type can be cut from this particular raw gem. (Alternatively, you can rotate the patterns and scan against the unrotated raw gem)
Now I just have to implement it.
Tests
Taking it slow ..
Safari
- Gazelle: 1/4
- Bullfrog: 1/4
Cicadas
- 4 speed points
- 0 cages placed
- 5 cages in hand
Acrobat
Finally passed, thanks to Rosethorn! Happy to teach, just drop past my compound.
