• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 02:21
CEST 08:21
KST 15:21
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
Serral wins EWC 202542Tournament Spotlight: FEL Cracow 202510Power Rank - Esports World Cup 202580RSL Season 1 - Final Week9[ASL19] Finals Recap: Standing Tall15
Community News
Weekly Cups (Jul 28-Aug 3): herO doubles up5LiuLi Cup - August 2025 Tournaments3[BSL 2025] H2 - Team Wars, Weeklies & SB Ladder10EWC 2025 - Replay Pack4Google Play ASL (Season 20) Announced55
StarCraft 2
General
Serral wins EWC 2025 Clem Interview: "PvT is a bit insane right now" TL Team Map Contest #5: Presented by Monster Energy Would you prefer the game to be balanced around top-tier pro level or average pro level? Weekly Cups (Jul 28-Aug 3): herO doubles up
Tourneys
WardiTV Mondays $5,000 WardiTV Summer Championship 2025 Sparkling Tuna Cup - Weekly Open Tournament LiuLi Cup - August 2025 Tournaments Sea Duckling Open (Global, Bronze-Diamond)
Strategy
Custom Maps
External Content
Mutation # 485 Death from Below Mutation # 484 Magnetic Pull Mutation #239 Bad Weather Mutation # 483 Kill Bot Wars
Brood War
General
How do the new Battle.net ranks translate? Nobody gona talk about this year crazy qualifiers? [G] Progamer Settings Help, I can't log into staredit.net BGH Auto Balance -> http://bghmmr.eu/
Tourneys
[ASL20] Online Qualifiers Day 2 [Megathread] Daily Proleagues Cosmonarchy Pro Showmatches [ASL20] Online Qualifiers Day 1
Strategy
Simple Questions, Simple Answers [G] Mineral Boosting Muta micro map competition Does 1 second matter in StarCraft?
Other Games
General Games
Stormgate/Frost Giant Megathread Total Annihilation Server - TAForever Nintendo Switch Thread Beyond All Reason [MMORPG] Tree of Savior (Successor of Ragnarok)
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread Vanilla Mini Mafia
Community
General
European Politico-economics QA Mega-thread US Politics Mega-thread Things Aren’t Peaceful in Palestine 9/11 Anniversary Possible Al Qaeda Attack on 9/11
Fan Clubs
INnoVation Fan Club SKT1 Classic Fan Club!
Media & Entertainment
Movie Discussion! [Manga] One Piece Anime Discussion Thread [\m/] Heavy Metal Thread Korean Music Discussion
Sports
2024 - 2025 Football Thread Formula 1 Discussion TeamLiquid Health and Fitness Initiative For 2023
World Cup 2022
Tech Support
Gtx660 graphics card replacement Installation of Windows 10 suck at "just a moment" Computer Build, Upgrade & Buying Resource Thread
TL Community
TeamLiquid Team Shirt On Sale The Automated Ban List
Blogs
[Girl blog} My fema…
artosisisthebest
Sharpening the Filtration…
frozenclaw
ASL S20 English Commentary…
namkraft
The Link Between Fitness and…
TrAiDoS
momentary artworks from des…
tankgirl
from making sc maps to makin…
Husyelt
Customize Sidebar...

Website Feedback

Closed Threads



Active: 581 users

Math Problem: Placing Numbers

Blogs > micronesia
Post a Reply
1 2 Next All
micronesia
Profile Blog Joined July 2006
United States24682 Posts
July 02 2009 20:05 GMT
#1
Someone I met on irc proposed a math problem and asked me to help him construct a computer program to solve it. I have some ideas about how to make the code, but I don't have the time to try to make the program, and he is a coding beginner so he can't do it himself. I can't think of any way to solve it without a computer, but I'd love to offer the problem to the community.

The Problem: (proposed by Joseph)

Imagine nine boxes equally spaced along the perimeter of a circle. We'll call the top-most position position #1. The next position clockwise is position #2, etc. through to #9. The goal is to place the numbers 1-9 in the boxes such that they obey the following:

If you place the number 3 in position one, then you have to count 3 boxes clockwise and place the next number in position 4. Then, if you put a '2' in that box your next number would have to go in position 6, etc. Essentially, if you place a number n in a box, then your next number goes n places clockwise from that position. You need to place 1-8 such that they don't overlap and previous numbers, and then 9 goes in the final position.

Solutions?

How many, if any, possible sequences of numbers can you use in order to solve this? Is there a mathematical way to solve it without using a computer program? If not, how would you construct a program to do this?

Disclaimer: this problem is for pure intellectual curiosity and is not assigned work

****
ModeratorThere are animal crackers for people and there are people crackers for animals.
Pawsom
Profile Blog Joined February 2009
United States928 Posts
July 02 2009 20:26 GMT
#2
Seems like a fairly straightforward backtracking problem unless I'm missing something.
Dromar
Profile Blog Joined June 2007
United States2145 Posts
July 02 2009 20:30 GMT
#3
My solution:

+ Show Spoiler +
Not possible. Since 9 would make a full circle and land on itself, it must be placed last. That means 1-8 must be placed first, but 1-8 sum up to 36, which is a multiple of 9, and so after placing the first 8 numbers, you will land on the first square you started at, which already has a number.
Pawsom
Profile Blog Joined February 2009
United States928 Posts
July 02 2009 20:30 GMT
#4
On July 03 2009 05:30 Dromar wrote:
My solution:

+ Show Spoiler +
Not possible. Since 9 would make a full circle and land on itself, it must be placed last. That means 1-8 must be placed first, but 1-8 sum up to 36, which is a multiple of 9, and so after placing the first 8 numbers, you will land on the first square you started at, which already has a number.


You need to place 1-8 such that they don't overlap and previous numbers, and then 9 goes in the final position.
Dromar
Profile Blog Joined June 2007
United States2145 Posts
Last Edited: 2009-07-02 20:37:58
July 02 2009 20:34 GMT
#5
On July 03 2009 05:30 Pawsom wrote:
Show nested quote +
On July 03 2009 05:30 Dromar wrote:
My solution:

+ Show Spoiler +
Not possible. Since 9 would make a full circle and land on itself, it must be placed last. That means 1-8 must be placed first, but 1-8 sum up to 36, which is a multiple of 9, and so after placing the first 8 numbers, you will land on the first square you started at, which already has a number.


You need to place 1-8 such that they don't overlap and previous numbers, and then 9 goes in the final position.


I'm aware.

+ Show Spoiler +
After placing the first 8 in such a manner, your only possible outcome is to have jumped 36 spaces, landing on an already filled space (specifically, the one you started on).


+ Show Spoiler +
In fact, this is impossible not for just 9 boxes and numbers 1-9, but for any number n boxes and numbers 1-n where n is odd. The proof is is simple as showing that for any n odd, the sum of 1 through (n-1) mod n is 0
micronesia
Profile Blog Joined July 2006
United States24682 Posts
July 02 2009 20:34 GMT
#6
Dromar I think you are correct. It makes sense.
ModeratorThere are animal crackers for people and there are people crackers for animals.
Pawsom
Profile Blog Joined February 2009
United States928 Posts
Last Edited: 2009-07-02 20:40:09
July 02 2009 20:35 GMT
#7
Ah I see what you mean. Silly me!

Looking at this further, there are only 8 possible solutions.

1 2 _ 3 _ _ 4 _ _. And here the five would "land" on the two. So four must be placed before two.

3 _ _ 4 _ _ _ 5 _. And here the six would land on the four. So six must be placed before five.

6 _ _ 9 8 _ 7 _ _. And here the nine lands on itself. Which brings us to what Dromar said about 9 having to be placed last.
armed_
Profile Joined November 2008
Canada443 Posts
July 02 2009 20:35 GMT
#8
Yeah, unless you described something wrong, Dromar's right.
TanGeng
Profile Blog Joined January 2009
Sanya12364 Posts
Last Edited: 2009-07-02 21:05:45
July 02 2009 21:02 GMT
#9
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.
Moderator我们是个踏实的赞助商模式俱乐部
vAltyR
Profile Blog Joined July 2008
United States581 Posts
July 02 2009 21:14 GMT
#10
On July 03 2009 06:02 TanGeng wrote:
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.


Where does 9 lie in your given solutions? Unless I missed something, that needs to be included as well.
내 호버크라프트는 장어로 가득 차 있어요
TanGeng
Profile Blog Joined January 2009
Sanya12364 Posts
July 02 2009 21:17 GMT
#11
On July 03 2009 06:14 vAltyR wrote:
Show nested quote +
On July 03 2009 06:02 TanGeng wrote:
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.

Where does 9 lie in your given solutions? Unless I missed something, that needs to be included as well.

1-8 is part of one cycle. 9 is its own cycle. That's how the problem is posed. There is no need to worry about 9 since it'll just occupy the only space that remains.
Moderator我们是个踏实的赞助商模式俱乐部
Dromar
Profile Blog Joined June 2007
United States2145 Posts
July 02 2009 21:20 GMT
#12
On July 03 2009 06:17 TanGeng wrote:
Show nested quote +
On July 03 2009 06:14 vAltyR wrote:
On July 03 2009 06:02 TanGeng wrote:
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.

Where does 9 lie in your given solutions? Unless I missed something, that needs to be included as well.

1-8 is part of one cycle. 9 is its own cycle. That's how the problem is posed. There is no need to worry about 9 since it'll just occupy the only space that remains.


There is one worry: you need to land on that "only space" in order to place the 9 there.
TanGeng
Profile Blog Joined January 2009
Sanya12364 Posts
July 02 2009 21:22 GMT
#13
On July 03 2009 06:20 Dromar wrote:
Show nested quote +
On July 03 2009 06:17 TanGeng wrote:
On July 03 2009 06:14 vAltyR wrote:
On July 03 2009 06:02 TanGeng wrote:
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.

Where does 9 lie in your given solutions? Unless I missed something, that needs to be included as well.

1-8 is part of one cycle. 9 is its own cycle. That's how the problem is posed. There is no need to worry about 9 since it'll just occupy the only space that remains.


There is one worry: you need to land on that "only space" in order to place the 9 there.

9 goes in the final position - the only one that remains. There is no stipulation that the 8th number in the sequence leads you to where you need to place 9.
Moderator我们是个踏实的赞助商模式俱乐部
cichli
Profile Joined August 2006
Sweden84 Posts
Last Edited: 2009-07-02 22:20:46
July 02 2009 21:31 GMT
#14
Placing numbers 1 to 9 on a circle according to your description has been solved by others on this thread, but if we generalize the problem to sequence of length n rather than length 9, we find the following solutions:

+ Show Spoiler +

Numbers 1-1 has one solution:
- [1]
Numbers 1-2 has one solutions:
- [1, 2]
Numbers 1-3 has no solutions.
Numbers 1-4 has two solutions:
- [1, 2, 4, 3]
- [3, 1, 4, 2]
Numbers 1-5 has no solutions.
Numbers 1-6 has four solutions:
- [1, 4, 2, 6, 5, 3]
- [2, 3, 5, 6, 1, 4]
- [4, 2, 5, 6, 1, 3]
- [5, 3, 1, 6, 4, 2]
Numbers 1-7 has no solutions.
Numbers 1-8 has 24 solutions:
- [1, 2, 5, 3, 8, 7, 4, 6]
- [1, 5, 2, 4, 8, 6, 7, 3]
- [1, 6, 2, 3, 8, 5, 7, 4]
- [1, 6, 4, 2, 8, 7, 5, 3]
- [2, 4, 5, 1, 8, 6, 3, 7]
- [2, 4, 7, 3, 8, 6, 1, 5]
- [2, 6, 1, 3, 8, 4, 7, 5]
- [2, 6, 3, 1, 8, 4, 5, 7]
- [3, 1, 4, 6, 8, 2, 7, 5]
- [3, 1, 5, 2, 8, 4, 6, 7]
- [3, 4, 5, 7, 8, 1, 6, 2]
- [3, 6, 7, 2, 8, 1, 4, 5]
- [5, 1, 2, 4, 8, 6, 3, 7]
- [5, 3, 1, 6, 8, 2, 4, 7]
- [5, 3, 4, 7, 8, 6, 1, 2]
- [5, 6, 2, 7, 8, 1, 3, 4]
- [6, 1, 3, 4, 8, 7, 5, 2]
- [6, 1, 5, 2, 8, 7, 3, 4]
- [6, 3, 1, 4, 8, 5, 7, 2]
- [6, 3, 7, 2, 8, 5, 1, 4]
- [7, 2, 4, 1, 8, 5, 3, 6]
- [7, 4, 1, 3, 8, 5, 6, 2]
- [7, 5, 1, 2, 8, 4, 6, 3]
- [7, 5, 3, 1, 8, 6, 4, 2]


I solved this by writing a simple SML program that does it by brute force: for each permutation of the numbers 1 through n, check if it's a valid sequence as defined in this thread. Thus, I ran out of memory when I tried solving it for sequence size 10 or larger.

Interesting observation:

+ Show Spoiler +

It seems that so far, only even sequence sizes yield solutions. Perhaps this holds some useful clue to the nature of these sequences?
The Internet will not listen to reason
coltrane
Profile Blog Joined June 2008
Chile988 Posts
July 02 2009 21:42 GMT
#15
Im gonna check this using group algebra, then in something about half an hour i can give you a good solution aplicable to summative groups of n elements...
Jävla skit
micronesia
Profile Blog Joined July 2006
United States24682 Posts
July 02 2009 22:14 GMT
#16
On July 03 2009 06:22 TanGeng wrote:
Show nested quote +
On July 03 2009 06:20 Dromar wrote:
On July 03 2009 06:17 TanGeng wrote:
On July 03 2009 06:14 vAltyR wrote:
On July 03 2009 06:02 TanGeng wrote:
Partial Solution:
I'm not going to tackle the computer programming portion just yet.

+ Show Spoiler +

The goal is to produce a sequence that produces a partial sum value that is always a different modulo with respect to 9 at all points in the series.

First of all the sum of 1-8 is 36 which is a multiple of 9 - equivalent of modulo 0.

Since the sequence always returns to the first position at the end, the sequence is cyclical. The starting point of any sequence that works doesn't matter. Inversion of the order also only results in inversion of the sign with respect to modulo, resulting in yet another valid sequence.

For example:
8-2-6-4-3-7-1-5 works so
2-6-4-3-7-1-5-8 also works and
5-1-7-3-4-6-2-8 also works

There's 16 derived solutions coming out of any one unique cycle.

This can be seen as creating 2 unique cyclical paths around the circle. One consisting of just the number 9, and one consisting of 1-8.

Where does 9 lie in your given solutions? Unless I missed something, that needs to be included as well.

1-8 is part of one cycle. 9 is its own cycle. That's how the problem is posed. There is no need to worry about 9 since it'll just occupy the only space that remains.


There is one worry: you need to land on that "only space" in order to place the 9 there.

9 goes in the final position - the only one that remains. There is no stipulation that the 8th number in the sequence leads you to where you need to place 9.

I think I was unclear in describing the problem. Although I didn't come up with it, I think the 9 is supposed to be landed on as a result of placing 8.
ModeratorThere are animal crackers for people and there are people crackers for animals.
ReMiiX
Profile Blog Joined April 2009
United States338 Posts
July 02 2009 22:18 GMT
#17
The code would be easy to do. PM me and we should discuss. My main language is Java but I do C++ and Python also. And this other thing called Fortran, stupid punch cards.
GaTech CSL fighting!
Crunchums
Profile Blog Joined December 2008
United States11144 Posts
July 02 2009 22:43 GMT
#18
It's not possible, Dromar is 100% correct.
brood war for life, brood war forever
cichli
Profile Joined August 2006
Sweden84 Posts
July 02 2009 23:13 GMT
#19
On July 03 2009 07:14 micronesia wrote:
Show nested quote +
On July 03 2009 06:22 TanGeng wrote:
9 goes in the final position - the only one that remains. There is no stipulation that the 8th number in the sequence leads you to where you need to place 9.

I think I was unclear in describing the problem. Although I didn't come up with it, I think the 9 is supposed to be landed on as a result of placing 8.


When you say 8 here, are you referring to the 8th number in the sequence, or the actual number 8? If you mean the actual number 8, does this also generalize so that the number n must be landed on as a result of placing n-1?
The Internet will not listen to reason
micronesia
Profile Blog Joined July 2006
United States24682 Posts
July 02 2009 23:53 GMT
#20
On July 03 2009 08:13 cichli wrote:
Show nested quote +
On July 03 2009 07:14 micronesia wrote:
On July 03 2009 06:22 TanGeng wrote:
9 goes in the final position - the only one that remains. There is no stipulation that the 8th number in the sequence leads you to where you need to place 9.

I think I was unclear in describing the problem. Although I didn't come up with it, I think the 9 is supposed to be landed on as a result of placing 8.


When you say 8 here, are you referring to the 8th number in the sequence, or the actual number 8? If you mean the actual number 8, does this also generalize so that the number n must be landed on as a result of placing n-1?

I meant 9 should be placed as a result of laying all numbers 1-8 in any order.... 8 could be first or fifth it don't matter.
ModeratorThere are animal crackers for people and there are people crackers for animals.
1 2 Next All
Please log in or register to reply.
Live Events Refresh
OSC
00:00
Elite Rising Star #16 - Day 1
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
-ZergGirl 142
ProTech25
StarCraft: Brood War
ggaemo 1815
actioN 732
Pusan 443
Leta 424
PianO 102
Backho 81
Noble 52
GoRush 29
HiyA 25
Bale 18
[ Show more ]
ivOry 7
Dota 2
monkeys_forever573
League of Legends
JimRising 789
Counter-Strike
Stewie2K747
Other Games
summit1g9158
Tasteless236
NeuroSwarm67
Pyrionflax51
Organizations
Other Games
gamesdonequick1297
StarCraft: Brood War
UltimateBattle 12
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 17 non-featured ]
StarCraft 2
• Berry_CruncH367
• practicex 67
• davetesta28
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• ZZZeroYoutube
• STPLYoutube
• BSLYoutube
League of Legends
• Rush1909
• Stunt421
• HappyZerGling315
Other Games
• Scarra932
Upcoming Events
OSC
3h 40m
WardiTV Summer Champion…
4h 40m
WardiTV Summer Champion…
8h 40m
PiGosaur Monday
17h 40m
WardiTV Summer Champion…
1d 4h
Stormgate Nexus
1d 7h
uThermal 2v2 Circuit
1d 9h
The PondCast
2 days
WardiTV Summer Champion…
2 days
Replay Cast
2 days
[ Show More ]
LiuLi Cup
3 days
uThermal 2v2 Circuit
3 days
RSL Revival
3 days
RSL Revival
4 days
uThermal 2v2 Circuit
4 days
CSO Cup
4 days
Sparkling Tuna Cup
5 days
uThermal 2v2 Circuit
5 days
Wardi Open
6 days
RotterdaM Event
6 days
Liquipedia Results

Completed

ASL Season 20: Qualifier #2
FEL Cracow 2025
CC Div. A S7

Ongoing

Copa Latinoamericana 4
Jiahua Invitational
BSL 20 Team Wars
KCM Race Survival 2025 Season 3
BSL 21 Qualifiers
HCC Europe
BLAST Bounty Fall Qual
IEM Cologne 2025
FISSURE Playground #1
BLAST.tv Austin Major 2025
ESL Impact League Season 7
IEM Dallas 2025

Upcoming

ASL Season 20
CSLPRO Chat StarLAN 3
BSL Season 21
BSL 21 Team A
RSL Revival: Season 2
Maestros of the Game
SEL Season 2 Championship
WardiTV Summer 2025
uThermal 2v2 Main Event
Thunderpick World Champ.
MESA Nomadic Masters Fall
CS Asia Championships 2025
Roobet Cup 2025
ESL Pro League S22
StarSeries Fall 2025
FISSURE Playground #2
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2025 TLnet. All Rights Reserved.