• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 08:41
CET 14:41
KST 22:41
  • 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
[ASL22] Finals Preview: Sweet Victory!12[ASL22] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11[ASL22] Ro16 Preview: Holy Diver5
Community News
Dark completes military service, returns to SC28[BSL23] RO16 Group Stage19Weekly Cups (Nov 2-8): herO back on top?2Weekly Cups (Oct 26 - Nov 1): MaxPax, herO, Solar win0Weekly Cups (October 19-25): Clem triples first in 5.0.175
StarCraft 2
General
Dark completes military service, returns to SC2 No more SC2 streamers on team liquid? Greetings.. Serral's getting trashed by New Catsle's Mind Weekly Cups (Nov 2-8): herO back on top?
Tourneys
Dark returns! GSL CK #7 4v4 Team Battle (Nov 19) Sea Duckling Open (Global, Bronze-Diamond) soO & FanTaSy return! SC2 Kevin Scrim 4v4 (Nov 16) RSL goes to London! 2026 Offline Finals Nov 21-22 Tasteless Time Warp: SC Evo Showmatch (May 25)
Strategy
[H] ZvP Mid-Late Game: Stalkers Collossi HT
Custom Maps
[G] How to playtest arcade maps Starcraft 2 Advance [D] the control group Simple Questions/Answers
External Content
The PondCast: SC2 News & Results Mutation # 551 Robotic Revival Mutation # 550 Graveyard Shift Mutation # 549 Endless Sparkles
Brood War
General
Starcraft:Brood War Discord Servers List of top players active on ShieldBattery [BSL23] RO16 Group Stage Starcraft player cRuZa Passed away. Recommended BW Settings for Mouse and Video
Tourneys
2v2v2v2 Tournament Stage 1: Community Poll [BSL23] Ro16 Group C - Sunday 21:00 CET Small VOD Thread 2.0 CSLAN 4 is Coming!
Strategy
Pluto's TvP 5Marine 2Medic Push Infested Terran strategies in 2026 Nuke strategy worked in K-League 2026-11-09 50,000-Word Terran Builds Memo 2026-10-22
Other Games
General Games
Free Space RTS Game, optimised f. Phone/Tablet etc Nintendo Switch Thread List of Game Threads The PlayStation 5 Stormgate/Frost Giant Megathread
Dota 2
Can Game Data Analytics Help Players Improvements
League of Legends
[TL LoL EUW IHs] Teemo shall perish
Heroes of the Storm
Heroes of the Storm 2.0
Hearthstone
Deck construction bug
TL Mafia
TL Mafia Community Thread
Community
General
US Politics Mega-thread Trading/Investing Thread European Politico-economics QA Mega-thread Russo-Ukrainian War Thread Dating: How's your luck?
Fan Clubs
Fan Club Resource Thread Reynor Fan Club The Flash Fan Club
Media & Entertainment
Movie Discussion! Anime Discussion Thread [Manga] One Piece
Sports
TeamLiquid Health and Fitness Initiative For 2023 Football (Soccer) Thread MLB/Baseball 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Recent Gifted Posts
Blogs
VCT 2027 America Kickoff LAT…
anakin.
The time I organised my…
AssyrianKing
Why I built Repalyzer (1.1.…
BlueStar
Innovate or Game Over?
TrAiDoS
ShieldBattery on Mac
Kraekkling
[ASL22] Ro4 Day1 Ticket Giv…
bITt.mAN
Can Bots Beat Pros?? Starcr…
namkraft
Customize Sidebar...

Website Feedback

Closed Threads



Active: 13419 users

Math Problem: Placing Numbers

Blogs > micronesia
Post a Reply
1 2 Next All
micronesia
Profile Blog Joined July 2006
United States24814 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 States24814 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 States24814 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 States24814 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
Next event in 20m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
ProTech155
Codebar 95
ForJumy 36
SHIN 32
OGKoka 1
StarCraft: Brood War
Calm 5886
Rain 1929
Jaedong 1050
Hyuk 817
EffOrt 707
BeSt 638
Mini 466
FanTaSy 430
Light 346
Rush 274
[ Show more ]
Larva 218
ggaemo 210
Stork 189
Leta 160
firebathero 153
Hyun 133
Snow 121
hero 120
Mind 111
Pusan 82
Shuttle 70
Killer 64
Bale 34
JYJ 29
Shinee 24
ToSsGirL 23
Sacsri 20
scan(afreeca) 19
sorry 19
sOs 18
Aegong 17
Hm[arnc] 17
Terrorterran 16
Movie 15
yabsab 14
zelot 12
Rock 7
Noble 6
Icarus 4
Counter-Strike
fl0m5275
Other Games
FrodaN2550
singsing1970
B2W.Neo991
Lowko368
XaKoH 211
crisheroes204
KnowMe168
byalli151
Fuzer 141
DeMusliM101
Mew2King48
CosmosSc2 13
Railgan4
fpsfer 3
Organizations
StarCraft 2
angryscii 23
[ Show 11 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• ChaeLyn 5
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• WagamamaTV660
League of Legends
• Jankos2826
Upcoming Events
OSC
20m
OSC
9h 50m
ByuN vs MaxPax
herO vs Krystianer
Percival vs Shameless
LetaleX vs YoungYakov
Nicoract vs Gerald
GgMaChine vs ArT
CranKy Ducklings
20h 20m
WardiTV Invitational
22h 20m
ByuN vs SHIN
MaxPax vs Solar
Clem vs TBD
herO vs TBD
Lambo vs TBD
Rogue vs TBD
IPSL
1d 3h
TerrOr vs IJ_Terran
rasowy vs Hazorath
BSL
1d 6h
TerrOr vs OyAji
UltrA vs Gosudark
Sparkling Tuna Cup
1d 20h
WardiTV Invitational
1d 22h
IPSL
2 days
Art_Of_Turtle vs KameZerg
Radley vs George
BSL
2 days
Artosis vs Dewalt
Ret vs Tech
[ Show More ]
WardiTV Weekly
2 days
Monday Night Weeklies
4 days
PiGosaur Cup
4 days
The PondCast
4 days
GSL
5 days
Replay Cast
6 days
KCM Race Survival
6 days
Liquipedia Results

Completed

Proleague 2026-11-12
Blizzard Classic Cup 2026
HCC Season 3

Ongoing

Acropolis #5
KCM Race Survival 2026 Season 4
International ShieldBattery League
Individual League
BSL Season 23
IPSL Winter 2026-27
Calamity Cup Div. A Season 8
BLAST Rivals Fall 2026
IEM Beijing 2026
PGL Masters Bucharest 2026
Stake Ranked Episode 5
1win Private Club #2
Thunderpick World Champ. '26
ESL Pro League Season 24
Stake Ranked Episode 4
1win Private Club #1
Logitech G Play Connect 2026
SL StarSeries Fall 2026
FISSURE Playground #3
BLAST Open Fall 2026

Upcoming

YSL S4
Sector 591
SC4ALL II: Brood War
BSL 23: Non-Korean Championship
HSC XXX
Stellar Fest 2: Lunar Cup
StarCraft2 Weekly Open Tournament 2026 Grand Finals
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
Underdog Cup 2026 Div 2-3
PGL Bucharest 2027
BLAST Bounty Winter 2027
PGL Major Singapore 2026
Stake Ranked Episode 6
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 © 2026 TLnet. All Rights Reserved.