This guide is made for the purpose of informing people of how to manage risk via proper usage of nodes in Mindnight. In Mindnight information is often ambiguous, as chat from good players is seldom sus good players seldom vote sus nodes are the most reliable source of information in the game. This is because nodes aren’t ambiguous they tell you exactly which player went into a node and how many hackers were detected; so the reason why this is more reliable is vote history as mentioned before can be manipulated so that hackers blend in nigh-perfectly with agents. In comparison nodes reveal information about people whether the person who did the prop that got accepted wants it to or not.
 
 

Introduction

This guide is made for the purpose of informing people of how to manage risk via proper usage of nodes in Mindnight. In Mindnight information is often ambiguous, as chat from good players is seldom sus good players seldom vote sus nodes are the most reliable source of information in the game. This is because nodes aren’t ambiguous they tell you exactly which player went into a node and how many hackers were detected; so the reason why this is more reliable is vote history as mentioned before can be manipulated so that hackers blend in nigh-perfectly with agents. In comparison nodes reveal information about people whether the person who did the prop that got accepted wants it to or not. This guide tells your probabilities of a hacker being in a specific node of all times in 5, 6, 7, 8 and player games. You are suggested to use this as reference and only consider memorizing 5 player probability, but these probabilities aren’t necessary to win reads are. If you want to improve look at your mistakes post game and figure out how to improve repeat.
 
 
 

The Numbers

The numbers are gathered under the conditions of 1. Outsider looking in we do not know anyones roles 2. This is randomly picked
 
 
5 Players 2 Chosen
 
 
P(0 Hackers) = 30%
 
 
P(1 Hackers) = 60%
 
 
P(2 Hackers) = 10%
 
 
5 Players 3 Chosen
 
 
P(0 Hackers) = 10%
 
 
P(1 Hackers) = 60%
 
 
P(2 Hackers) = 30%
 
 
6 Players 2 Chosen
 
 
P(0 Hackers) = 40%
 
 
P(1 Hackers) = 53.33…%
 
 
P(2 Hackers) = 6.66…%
 
 
6 Players 3 Chosen
 
 
P(0 Hackers) = 20%
 
 
P(1 Hackers) = 60%
 
 
P(2 Hackers) = 20%
 
 
6 Players 4 Chosen
 
 
P(0 Hackers) = 6.66…%
 
 
P(1 Hackers) = 53.33…%
 
 
P(2 Hackers) = 40%
 
 
7 Players 2 Chosen
 
 
P(0 Hackers) = 28.57142857%
 
 
P(1 Hackers) = 57.14285714%
 
 
P(2 Hackers) = 14.28571429%
 
 
7 Players 3 Chosen
 
 
P(0 Hackers) = 11.42857143%
 
 
P(1 Hackers) = 51.42857143%
 
 
P(2 Hackers) = 34.28571429%
 
 
P(3 Hackers) = 2.857142857%
 
 
7 Players 4 Chosen
 
 
P(0 Hackers) = 2.857142857%
 
 
P(1 Hackers) = 34.28571429%
 
 
P(2 Hackers) = 51.42857143%
 
 
P(3 Hackers) = 11.42857143$
 
 
8 Players 3 Chosen
 
 
P(0 Hackers) = 17.85714286%
 
 
P(1 Hackers) = 53.57142857%
 
 
P(2 Hackers) = 26.78571429%
 
 
P(3 Hackers) = 1.785714286%
 
 
8 Players 4 Chosen
 
 
P(0 Hackers) = 7.142857143%
 
 
P(1 Hackers) = 42.85714286%
 
 
P(2 Hackers) = 42.85714286%
 
 
P(3 Hackers) = 7.142857143%
 
 
8 Players 5 Chosen
 
 
P(0 Hackers) = 1.785714286%
 
 
P(1 Hackers) = 26.78571429%
 
 
P(2 Hackers) = 53.57142857%
 
 
P(3 Hackers) = 17.85714286%
 
 
 

Methods

The methods I used was initially probability trees and later on hypergeometric functions.
 
My work is in this pdf https://anonfiles.com/h7i7r7o1y2/Mindnight_Hacker_Probablities_pdf – [anonfiles.com] 
 
and in the first page zoom in on the paper to get the odds of 5 players, 3 people, and 0, 1, 2 hackers.
 
 

 
 
Here we come to an end for MINDNIGHT How to manage risk via proper usage of nodes hope you enjoy it. If you think we forget something to include or we should make an update to the post let us know via comment, and we will fix it asap! Thanks and have a great day!