Nomic: Wiki Edition --- Finished (More or Less)

[StrangerCoug]

VOTE: Nay 345

I get the point of expedience that Jake is making, but it's a solution in search of a problem. The existing rule that you must transmute an immutable rule to mutable first is by design. If someone proposes to transmute an immutable rule to mutable, that person is probably against the rule being immutable to begin with.

[Jake The Wolfie]

Not really. You could be fine with a rule being immutable, but what the rule is specifically could be a problem.

[Ircher]

Give StrangerCoug 1 Knowledge Point

for post 475.

Question of the Day #5
Category: Religion
Question: In Islam, hadiths are considered the oral sayings of the Prophet Muhammad. What are the two parts that they consist of? (You can either give the name of the parts or a description of the parts.)

You will have (expired on 2021-11-10 22:00:00) to answer.

Time has expired. Hadiths consist of the

sanad

which is a history of its transmission and the

matn

which is the saying itself.

Question of the Day #6

Category: Computer Science
Question: Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)
Bonus: If you answer this question correctly

and

name the other algorithm I am referencing here, you will get an additional 10 Knowledge Points. Please note that you must be specific as to which answer corresponds to which algorithm. (That is, if you answer both the question and the bonus, you need to make it clear which answer corresponds to minimum spanning trees and which algorithm corresponds to the shortest path problem.)

[StrangerCoug]

Not really. You could be fine with a rule being immutable, but what the rule is specifically could be a problem.

Hence why I said "probably", not "certainly". It's a rare situation, and the current way allows a rule to be more thoroughly vetted while it's mutable. Your proposal blurs the line between mutable and immutable and simply makes it a matter of whether unanimous consent is required to amend or repeal a rule. I'm not comfortable with that.

Question of the Day #6

Category: Computer Science
Question: Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)
Bonus: If you answer this question correctly

and

name the other algorithm I am referencing here, you will get an additional 10 Knowledge Points. Please note that you must be specific as to which answer corresponds to which algorithm. (That is, if you answer both the question and the bonus, you need to make it clear which answer corresponds to minimum spanning trees and which algorithm corresponds to the shortest path problem.)

Ah, man, I used to know this one, and I have a CS degree. Is the minimum spanning tree algorithm the Dijkstra algorithm and the shortest path algorithm the A* search algorithm?

[Ircher]

Ah, man, I used to know this one, and I have a CS degree. Is the minimum spanning tree algorithm the Dijkstra algorithm and the shortest path algorithm the A* search algorithm?

That is incorrect unfortunately, but both are good guesses. You can try again in about 8 hours (so 8 am EST/1 pm UTC).

[Jake The Wolfie]

Hence why I said "probably", not "certainly". It's a rare situation, and the current way allows a rule to be more thoroughly vetted while it's mutable. Your proposal blurs the line between mutable and immutable and simply makes it a matter of whether unanimous consent is required to amend or repeal a rule. I'm not comfortable with that.

I mean, unanimous consent is already required to amend or repeal an immutable rule. The only real exception involves vote manipulation.

[Ircher]

lendunistus is at the 3 day mark. Unfortunately, the rules require 5 active players for us to vote on and make proposals, so hopefully lendunistus posts or we can find someone else to join.

[lendunistus]

sorry for not existing

I just don’t really have anything exciting to do here

[Ircher]

Question of the Day #6
Category: Computer Science
Question: Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)
Bonus: If you answer this question correctly and name the other algorithm I am referencing here, you will get an additional 10 Knowledge Points. Please note that you must be specific as to which answer corresponds to which algorithm. (That is, if you answer both the question and the bonus, you need to make it clear which answer corresponds to minimum spanning trees and which algorithm corresponds to the shortest path problem.)

Any other takers? I will be posting the solution around 9-10 pm EST.

[Deimos27]

Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)

I have no idea what any of this means and will guess alpha-beta pruning

[Deimos27]

VOTE: Aye M006
This was the victory trophies one right
May as well

[Ircher]

M006 passes.
---

Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)

I have no idea what any of this means and will guess alpha-beta pruning

This is incorrect.

Question of the Day #6
Category: Computer Science
Question: Which algorithm for finding the minimum spanning tree of a graph is a variation of another algorithm that is used to find the shortest path between two nodes provided the graph has no nonpositive weighted nodes? (As always, spelling counts.)
Bonus: If you answer this question correctly and name the other algorithm I am referencing here, you will get an additional 10 Knowledge Points. Please note that you must be specific as to which answer corresponds to which algorithm. (That is, if you answer both the question and the bonus, you need to make it clear which answer corresponds to minimum spanning trees and which algorithm corresponds to the shortest path problem.)

The correct answers are

Prim's Algorithm

for finding the minimum spanning tree and

Dijkstra's Algorithm

for finding the shortest path between vertices in a graph with only positive weighted vertices. The two algorithms are essentially the same except in Prim's algorithm, you don't keep up with previous distances. StrangerCoug was really close with his answer as A* is another path finding algorithm; A* is sort of a hybrid between Dijkstra's algorithm; it is basically Dijkstra with an added heuristic that estimates how far away the goal is.

Give StrangerCoug 3 Knowledge Points

Give Deimos27 1 Knowledge Point

---

Question of the Day #7

Can you believe it's already been a week since I've started doing these?

Category: Literature
Question: The novel

The Lord of the Rings

was published in stages in three separate volumes. What are the titles of these volumes?

In other news, I am changing the way KP are awarded for answering questions.
- If you submit an incorrect guess, you will get between 0 and 3 Knowledge Points. You can interpret them as follows:
-- 0 ==> Guess does not make sense in the context of the given category.
-- 1 ==> Guess shows some knowledge of the question and its answer, but it is still a long ways off from the correct answer.
-- 2 ==> The guess is reasonable and well-informed, but it may miss some key aspects of the question.
-- 3 ==> The guess is almost the correct answer, but it is not close enough to be acceptable.
- If you correctly answer a question, you will now get

30 Knowledge Points

instead of 15.

[StrangerCoug]

Category: Literature
Question: The novel

The Lord of the Rings

was published in stages in three separate volumes. What are the titles of these volumes?

The Fellowship of the Ring

,

The Two Towers

, and

The Return of the King

[Ircher]

That is correct!

Give StrangerCoug 30 Knowledge Points.

[Ircher]

Motion M007: This motion lasts for one second. "Money Sap Spell" are permanently added to the shop at the cost of N$225. This item is consumed after three uses and requires 2 red mana and 1 blue mana to cast. When cast, select a target. The target loses either 1d100 Nomic dollars (use the dice tags) or all of their current supply of Nomic dollars (whichever is lower), and the spell caster gains the equivalent amount back.

Motion M008: This motion lasts for one second. "Victory Quiz Tokens" are permanently added to the shop at the cost of either N$5'000 or 30000 KP. For the purpose of costs in other currencies, the exchange rate of Nomic Dollars shall be used. These items are consumed when used. Once used, the user may post a set of questions known as a "victory quiz". The victory quiz consists of a set of up to five questions that possess an objective answer (but questions with multiple valid answers, provided they are objective, are valid). The author of the quiz must know the answers to the questions at the time of the quiz creation. Specific rules regarding allowed resources on a quiz shall be specified by the quiz author; however, it should be assumed that if not otherwise stated, the use of the Internet to search for solutions is not allowed. Each player gets 48 hours to attempt to answer the victory quiz correctly; players shall submit their answers by PM to the quiz author. Players are allowed only one guess, and they do not immediately learn whether their answers are correct or not. At the conclusion of the 72 hours, the answers to the quiz shall be posted alongside the submitted answers. The author of the quiz shall grade each quiz submission in a way they deem appropriate. Players receive 100 * (Quiz Score Converted To Percentage of Max Score) KP, and any player who scores 80% of the maximum possible points on the quiz or better shall receive 3 points. The author of the quiz also receives 1 point. The victory quiz itself, the correct answers, and percentage scores for each player shall be recorded on the wiki in the event history.

[StrangerCoug]

VOTE: Yea M007
VOTE: Yea M008

[Ircher]

Question of the Day #8

Category: History
Question: Who is known as the "father of anatomy" and is credited as the first physician to dissect human bodies?

[StrangerCoug]

Buy 2 Victory Trophies

[Deimos27]

VOTE: Aye M007
VOTE: Aye M008

[Ircher]

Motion M007 and M008 pass.

[Deimos27]

Ok time to maybe finally set some new questions

Comparative politics could be interesting

1. Categorise the following countries according to whether they are parliamentary, semi-presidential, or presidential democracies: USA, South Korea, Brazil, UK, France (2KP each)

2. What is the difference between a vote of no confidence and a constructive vote of no confidence? (10KP)
- 3. Name two countries that use a constructive vote of no confidence (5KP each)

4. Tsebelis (1995) defined the notion of veto players. What is the current number of (a) institutional and (b) partisan veto players in the political system of the United Kingdom? (5KP each)

5. Linz (1985) argued that presidential systems are more prone than parliamentary systems to what phenomenon? (15KP)
Hint: 20th century Latin America is often pointed to for correlational evidence of this

[Ircher]

Prodding Jake The Wolfie (2d 0h).

[Jake The Wolfie]

I threw out the mana system for others to maybe build upon.

[Ircher]

I would love to see new spells and stuff that require mana, but I lack ideas. Maybe we need to add more systems via proposals.

[Jake The Wolfie]

Motion M009 - (This motion lasts for 1 second) The following item shall be added to the Nomic Shop as a permanent: Conjure Wall (N$1000): This spell costs at least 1 mana to cast. When casted, you gain control of a wall with the following text, where X is the amount of mana used to cast the spell: "This wall has a durability of X. If you are the target of a spell, this wall protects you from that spell, and this wall takes damage equal to the spell's mana cost." If you casted this spell using only one mana color, the wall also gains "This has protection from Y.", where Y is the color of mana used to cast this spell.

Proposal 345 - Any player may create and define keywords without the need for any proposal to pass. These keywords should be recorded somewhere on the wiki.

M009 draws a little bit from 345.

The main reason for 345 is so that any time we need a new keyword for stuff, we don't need everyone's approval each time just to define terms.