I am currently looking to implement an algorithm, that matches a given set of individuals, and produces groups of three individuals who have all never seen each other. So far I have been trying to achieve this by creating an array and assigning each individual a prime number (the id), which gets multiplied with another individuals id to create a key upon matching. This will then be used in successive matches to eliminate the possibility of matching again. So far the groups have been formed by simply taking a list of individuals, starting from the first and then matching that indiviual with the first individuals in the list, whose id does not divide the key, and then removes that group. However this has sometimes led to groups of people being left over, so i wanted to ask whether there is an existing algorithm for this problem already?
Is there an efficient algorithm for maching unique individuals so that no group of them have ever seen each other?
127 Views Asked by IronicOwl At
0
There are 0 best solutions below
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in MATCHMAKING
- Problem with Matchmaking two players in realtime database
- Bin Packing Algorithm for Teammate finder app?
- Generating the docker image when open-match proto api is updated
- problem in real time match-making and lobby implementation
- Javascript (nodejs) matchmaking queue
- Dummy players in with unity matchmaker
- How to create an algorithm for matchmaking using jetpack compose and MongoDb?
- Gale Shapley matching algorithm with Polygamy by Men Upto four Marriages Using Bipartite Graph
- How to use django channel to create a game lobby and matchmaking
- Best way to implement matchmaking queue for a competitive game
- Match users in pair array but avoid previous matches
- Is there an efficient algorithm for maching unique individuals so that no group of them have ever seen each other?
- Algorithm to match most possible combinations
- Trying to select a random user against the current user for a match with both having the same role
- Firebase Realtime Database - Matchmaking using transactions = High download usage
Related Questions in SPORTS-LEAGUE-SCHEDULING-PROBLEM
- Swiss Scheduling System for Ping-Pong league
- Round-robin scheduling algorithm for Premier League style football tournament in VB.NET
- MS Access Compile Error: Type Mismatch array or User-defined type expected
- scheduling program for more than two teams per game
- What are some possible approaches for selecting best possible matches?
- Deconflict constrained N team schedule
- Creating a Round- Robin tournament, alternative solution?
- Is there an efficient algorithm for maching unique individuals so that no group of them have ever seen each other?
- Are there any algorithm that solves the following problem in time less than O(n!)?
- Equally distribute opponents in "Switch Doubles Round Robin Tournament"
- Sports tournament schedule with changing pairs
- Generate a table that meet conditions (tournament team assignation)
- Selecting pairs of teams to play each round, with maximum exposure before repeats
- Randomise round-robin league schedule given certain constraints
- Football match scheduling algorithm
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?