#1)

* Matchmaking graph only to include preferred match edges where the match is actually possible as determined by matches_with. _rank_partners still runs in O(n + SM_NUM_TO_RANK log n) but now requires O(n) space, with n the number of total searches.

* typo

* adjusting deviation and rating in test_rank_all unit test such that all matches become possible

* add test for rank_all not including unmatchable games

* Dostya test user in test_server_ban integration test now expected to be banned for 980 years, not 981

* tests on reasonable matchmaking thresholds

* determine base minimum threshold for acceptable matches as 80% of quality of a game against yourself

* increase new player threshold boundary

* test that matchmaker gives high quality games to plawers with low deviation and games of any quality to new players with uncertain rating

* adjust values for base rank_all test so that players are matchable

* unit test typos

* fixed preference order of test_rank_all

…iage.find

…yers and low-dev with low-dev if all share the same mean

…parties

Typos

Co-Authored-By: Askaholic <askaholic907@gmail.com>

…nto match-newbies-randomly

…N_RATING = 2000

* rename 2500 rated player to top_player

* refactor matchmaker

* adapt tests to new interface for matchmaking policies

* add test that Random Matching produces symmetric outputs

* correct type annotations for MatchmakingPolicies .find methods

* test for matchmaker class

* remove __repr__ method of search

…es-randomly

Co-Authored-By: Askaholic <askaholic907@gmail.com>

…ies-randomly

…hms are used