Demonic God

For those looking to ensure their strategy can cover all scenarios, I suggest looking into programming diagram/flowcharts! Here's an example diagram of a simple logic/strategy:

As you can tell from... the Darvin quest, I am a bit obsessed with Advanced Aramors! So, as part of an experiment, I would love to craft Aramors that are capable of doing more, on their own. To that end, I'd love to start with making Aramors that can, for now, participate in simple games of Rock Paper Scissors! Your goal for this quest, would be to aid me in making such a creation. Specifically, I ask for you to design a strategy, one that is unambiguous and non randomized. Something that an Aramor can be programmed with! Your strategy will compete with others in a tournament. The rules for the tournament is as follow: Every strategy will compete with every other strategy Each duel will last until one side receive 3 10 wins. If it is mathematically impossible exceeds 500 draws, both side receives a loss it's considered a draw. This was added because the 500 draws checker got tripped... a lot. The worst strategy will be eliminated after every duel has happened. This will repeat with the surviving strategies until one emerge victorious The worst strategy would be evaluated with the following criteria: Least wins Most losses Lose against strategies with similar win/loss (i.e if A has 2 wins and 5 losses, and B also has 2 wins and 5 losses, and B lost against A, then B is eliminated) If the above criteria fail to select a single loser, all of them would be eliminated The tournament will repeat without the winner(s) until all prizes are filled The rules for strategies are as follow: Your goal is to design a strategy, to participate in a tournament of rock, paper, scissors! Your strategy must not be random and must cover all scenarios. Your strategy is not limited to the game itself. It can adapt to the round it's on, the opponent, etc. Possible strategy includes: Always choose rock If there is less than 3 participant left, always choose rock If opponent is Aia, always choose rock Cooperation is not only allowed, it is welcomed. You are free to rig matches as you please. Rewards 1st - Anniversary creature. A choice between a colored pope, and a colored elemental, courtesy of Lady @Aia del Mana 2nd - Anniversary creature. A colored pope or elemental, whichever remains after the winner had their pick 3rd - Anniversary creature. Deadline: I wish to wrap up the competition as soon as everyone who wish to join had done so. Thus, there would be two deadlines: Hard deadline: End of anniversary + 3 days. Soft deadline: 9 days (April 21st) from now. After this date, I will begin judging as soon as everyone who had announced their participant has submitted their strategy. You may join in after the soft deadline, as long as judging has not begun. Soft deadline is meant to avoid unnecessary waiting.

What if instead of having links below the portrait, we have different zones on the portrait itself? If we're going to do the card route, it'd be nice to have the portrait to be a lot more interactive.

I've seen this in the past @@

After informing and clearing potential cheese with Aia... I can now do this with good conscience xD

I shall have the honor of making the first moss meme!

let's start with a meta meme I suppose :3 Here be Aia:

As approved, I'd like: 1 Anni (15) 3 Cake (6) 3 Pickle (12) Thank you!

Yes. This is just me trying to be creative in writing that you need to prove that he must be captured, regardless of his movements or starting location. Filling the board is an example of a strategy that works. Your goal is to find a strategy with the least amount of holders.

This quest was originally ran during the 2020 anniversary - here. After nearly a year, I happened to discuss this quest with @Aia del Mana, who had generously offered to sponsor this into a permanent quest. In essence, the quest is identical, though, after it has proven to be of... quite high difficulty, the requirements has been reduced somewhat, and the rewards increased to reflect it. The quest will be, as following: A hunt for Darvin. Darvin, the advanced Aramor, had escaped into a new section of the labyrinth, and needs to be captured. This new section is a huge interconnected area, akin to a chessboard. Each turn, A25 holders, using their given A25 tools, freely teleports into a tile of their choosing. Each turn, Darvin surfs the heat current, moving to a different adjacent tile. He cannot move to tiles diagonal to his current location, as there would be no heatvein connecting the two square. He cannot remain still, as such is the nature that he was given. Each party action happen simultaneously. The tool holders and Darvin must move, at the same turn, to the same square, for Darvin to be considered "found". By chance, magic, or unknown mechanic within the realm itself, almost like quantum physics, he cannot be found unless, by deduction, he must be found. Should one seek him out at random, even how improbable it would be, he shall never be found. Noticing these rules, Chew deducted a simple way method: to organize a massive manhunt, placing players in every tile. Gets the job done, gets it done fast. However, Mur insist that the A25 tools may only be handed out to as few people as possible. To this end, find the methods needed, and the numbers of tools to hand out, to solve the following situations: 1. If the labyrinth size is 3x3. For this simple case, simply pointing out a correct pattern (with the minimum number of tools holders), would suffice. Those who solve this should expect a spell document to celebrate their success. 2. If the labyrinth size is 5x5. A detailed mathematical proof, showing not only the pattern, but that it is indeed the minimum number of tool holder needed. A wishpoint will be rewarded. 3. If the labyrinth size is unknown (n x n). A detailed mathematical proof, showing the pattern/rules is required. A single selection between a colored Winderwild, Elemental, or Pope, shall be rewarded. This is not first-come, first-served, anyone who managed to meet the requirements shall be rewarded all the same. I could provide aid and discussion if you want to challenge this - as this task is quite difficult. In mathematical terms (or simplified terms): Darvin will be on a chessboard-like grid. Each turn, he must move one tile, up, down, left or right. Each turn, you choose a number of squares to find Darvin. Actions happen simultaneously. Darvin is considered found, if he and you chose the same square. Darvin cannot be found at random. You must prove that he must be found using your pattern. Think of it as a strategy game, and that he knows your strategy from the very start. Find a pattern that he can't beat. You must find a pattern that requires the least amount of searches per turn. 1. Find the solution if the square is 3x3. No proof required, just the pattern. I've been authorized to grant you a spell-document should you submit a valid solution. 2. Find the solution if the square is 5x5. Proof, including why the pattern is optimal (uses the least amount of searches per turn), is required. A wishpoint will be rewarded. 3. Find the general solution for an n x n square, showing the pattern, as well as the proof for why it is optimal. Aid may be provided if requested. You may choose between a colored Winderwild, Elemental, or Pope as your reward. Rules: Solutions must be submitted in a private manner. Any private methods is acceptable, though I must warn that I do not check the ingame inbox often. Do not discuss, share, or collaborate. Please check your work thoroughly before submitting. If I feel like you're probing for the answer by having me pointing out mistakes, you may be disqualified. This applies mostly to reward 1, and somewhat for reward 2. To clarify, for task 2 and 3, a detailed proof of not only how the pattern will work, but also why you can't find Darvin with less tool holders will be required. For task 1, simply showing a pattern would suffice, without much explanation needed. If there's anything you need clarification on, feel free to DM or post a reply. Winners: Tier 1: @Aelis(as he finished it during the 2020 anniversary) @Kaya- May 7th, 2021 Tier 2: @Kaya- May 10th, 2021 Tier 3:

since I still don't know what's happening in the auction yet... well, I'll just assume I spent 140 there I'd like: Gold Avatar Token Anni Pin Anni cake Anni Crit Total: 55

O.o Do I make a themed discrete math challenge, or do I not

item 6: 140

Item 6: 130

Woops, missed the buds, mobile sucks Windy: 125

Wind drachorn: 100

Windy: 95

Item 6: 90

Wind drachorn: 85

wind drachorn: 80

Wind drachorn: 75

Wind drachorn, 60

Wind Drachorn, 50

Drachorn, 35

I'll add some skills that have that some may find interesting Cooking tips and tricks Programming. Chew would be the more experienced person, but I can answer questions for those starting out and basic information. My knowledge range from: Verilog/System Verilog, C/C++, Python, Java, JS/Jquery, CSS/HTML, and a bit of Autohotkey. I may not have too much expertise, but I do have a perspective of a recent learner Basic economics. While I do not know much more in-depth knowledge, I am very interested about economics in general, and do have some knowledge based on my own research and education Mathematics, especially discrete. Well, I did not follow this field of study, sometimes I wish I did, but if it's not some too high level mathematics, I may interest you in some ways Teaching, is a good way to learn, and to strengthen your understanding of a matter. My preferred medium would be discord, as it provide a lot of flexibility