• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 18:57
CET 00:57
KST 08:57
  • 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 SC211[BSL23] RO16 Group Stage20Weekly 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
No more SC2 streamers on team liquid? Dark completes military service, returns to SC2 Greetings.. Serral's getting trashed by New Catsle's Mind Weekly Cups (Nov 2-8): herO back on top?
Tourneys
Sparkling Tuna Cup - Weekly Open Tournament Sea Duckling Open (Global, Bronze-Diamond) Dark returns! GSL CK #7 4v4 Team Battle (Nov 19) soO & FanTaSy return! SC2 Kevin Scrim 4v4 (Nov 16) RSL goes to London! 2026 Offline Finals Nov 21-22
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
Mutation # 552 Secret Storm The PondCast: SC2 News & Results Mutation # 551 Robotic Revival Mutation # 550 Graveyard Shift
Brood War
General
Top Players of October 2026 (EBPD Rankings) Starcraft:Brood War Discord Servers [BSL23] RO16 Group Stage New 40-minute movie with Jaedong JyJ SnOw List of top players active on ShieldBattery
Tourneys
[BSL23] Ro16 Group C - Sunday 21:00 CET [$1250] International ShieldBattery League [Megathread] Daily Proleagues [BSL23] Ro16 Group A - Saturday 21:00 CET
Strategy
Pluto's TvP 5Marine 2Medic Push Simple Questions, Simple Answers Infested Terran strategies in 2026 Nuke strategy worked in K-League 2026-11-09
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Free Space RTS Game, optimised f. Phone/Tablet etc List of Game Threads The PlayStation 5
Dota 2
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 Things Aren’t Peaceful in Palestine Artificial Intelligence Thread Trading/Investing Thread European Politico-economics QA Mega-thread
Fan Clubs
Fan Club Resource Thread Reynor Fan Club The Flash Fan Club
Media & Entertainment
Movie Discussion! Anime Discussion Thread [Manga] One Piece
Sports
Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023 MLB/Baseball 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Recent Gifted Posts
Blogs
The time I organised my…
AssyrianKing
Why I built Repalyzer (1.1.…
BlueStar
Innovate or Game Over?
TrAiDoS
ShieldBattery on Mac
Kraekkling
Can Bots Beat Pros?? Starcr…
namkraft
Customize Sidebar...

Website Feedback

Closed Threads



Active: 11101 users

The Big Programming Thread - Page 716

Forum Index > General Forum
Post a Reply
Prev 1 714 715 716 717 718 1032 Next
Thread Rules
1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution.
2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20)
3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible.
4. Use [code] tags to format code blocks.
Prillan
Profile Joined August 2011
Sweden350 Posts
April 01 2016 18:52 GMT
#14301
On April 02 2016 03:06 spinesheath wrote:
Show nested quote +
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.
TheBB's sidekick, aligulac.com | "Reality is frequently inaccurate." - Douglas Adams
Acrofales
Profile Joined August 2010
Spain18501 Posts
April 01 2016 19:01 GMT
#14302
On April 02 2016 02:47 tofucake wrote:
wat?

c = 4 changes the equation to -31 = a^3 + b^3, not -53...

Yeah. Arithmetic fubar.
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
April 01 2016 19:02 GMT
#14303
On April 02 2016 03:52 Prillan wrote:
Show nested quote +
On April 02 2016 03:06 spinesheath wrote:
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.

But the formula presented in the video for infinitely many solutions does not include all solutions either.
If you have a good reason to disagree with the above, please tell me. Thank you.
Acrofales
Profile Joined August 2010
Spain18501 Posts
April 01 2016 19:12 GMT
#14304
I wonder if there are numbers for which there are infinitely many parametric solutions?
Prillan
Profile Joined August 2011
Sweden350 Posts
April 01 2016 20:02 GMT
#14305
On April 02 2016 04:02 spinesheath wrote:
Show nested quote +
On April 02 2016 03:52 Prillan wrote:
On April 02 2016 03:06 spinesheath wrote:
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.

But the formula presented in the video for infinitely many solutions does not include all solutions either.

That's exactly what it does, it's the whole point of it.

The equation 1 = a^3 + b^3 + c^3 has integer solutions a = 1 + 9m^3, b = 9m^4, c = -9m^4 - 3m for all (integers) m.

On April 02 2016 04:12 Acrofales wrote:
I wonder if there are numbers for which there are infinitely many parametric solutions?

That depends on what you mean by "infinitely many parametric solutions".
TheBB's sidekick, aligulac.com | "Reality is frequently inaccurate." - Douglas Adams
CoughingHydra
Profile Blog Joined May 2012
177 Posts
April 01 2016 20:13 GMT
#14306
This problem is a "Number Theory" problem; the type of equation you're trying to solve is called a Diophantine equation. This question is relevant. Despite what is said in that link, there are surely many algorithms for specifics problems.
Wrath
Profile Blog Joined July 2014
3176 Posts
April 01 2016 20:21 GMT
#14307
On April 02 2016 05:13 CoughingHydra wrote:
This problem is a "Number Theory" problem; the type of equation you're trying to solve is called a Diophantine equation. This question is relevant. Despite what is said in that link, there are surely many algorithms for specifics problems.


Yep, yesterday on ICCUP was discussing this type of question with fululf and he was trying to solve such equation (though his was linear one, not cubic) using the "Euclidean Algorithm"
Manit0u
Profile Blog Joined August 2004
Poland17875 Posts
April 01 2016 20:48 GMT
#14308
I really tried to do maths once, but then I come to read sentences like "conjectural Langlands correspondence on representations of the absolute Galois group of a number field" and my brain said "nope".
Time is precious. Waste it wisely.
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
April 01 2016 21:15 GMT
#14309
On April 02 2016 05:02 Prillan wrote:
Show nested quote +
On April 02 2016 04:02 spinesheath wrote:
On April 02 2016 03:52 Prillan wrote:
On April 02 2016 03:06 spinesheath wrote:
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.

But the formula presented in the video for infinitely many solutions does not include all solutions either.

That's exactly what it does, it's the whole point of it.

The equation 1 = a^3 + b^3 + c^3 has integer solutions a = 1 + 9m^3, b = 9m^4, c = -9m^4 - 3m for all (integers) m.

1 = 1^3 + 2^3 + (-2)^3
What m would produce this valid solution? None of these terms can ever be equal to 2 as far as I can tell.

So for each m this produces a valid solution, but it does not produce all the solutions.
If you have a good reason to disagree with the above, please tell me. Thank you.
Acrofales
Profile Joined August 2010
Spain18501 Posts
Last Edited: 2016-04-01 21:41:30
April 01 2016 21:40 GMT
#14310
On April 02 2016 05:02 Prillan wrote:
Show nested quote +
On April 02 2016 04:02 spinesheath wrote:
On April 02 2016 03:52 Prillan wrote:
On April 02 2016 03:06 spinesheath wrote:
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.

But the formula presented in the video for infinitely many solutions does not include all solutions either.

That's exactly what it does, it's the whole point of it.

The equation 1 = a^3 + b^3 + c^3 has integer solutions a = 1 + 9m^3, b = 9m^4, c = -9m^4 - 3m for all (integers) m.

Show nested quote +
On April 02 2016 04:12 Acrofales wrote:
I wonder if there are numbers for which there are infinitely many parametric solutions?

That depends on what you mean by "infinitely many parametric solutions".


Well, for 1 = a^3 + b^3 + c^3 you have at least two:

a = 1 + 9m^3, b = 9m^4, c = -9m^4 - 3m
a = 1, b = m, c = -m

Now I am not talking about trivially equivalent equations, of which there are obviously infinite (a = 1, b = x, c = -x for instance is "different" from the latter equation, but is a syntactic equivalent. Similarly a= 73(x - 1) - 73x + 74, b = x, c= -x is equivalent to it), but parametric solutions that are different like the above two parametric solutions are different.
tofucake
Profile Blog Joined October 2009
Hyrule19270 Posts
Last Edited: 2016-04-01 21:44:35
April 01 2016 21:44 GMT
#14311
asldjkfhgasdf
Liquipediaasante sana squash banana
IyMoon
Profile Joined April 2016
United States1249 Posts
April 03 2016 02:07 GMT
#14312
Hey everyone! Long time lurker of the regular form. I just got my first job as a programmer and the tech stack is something I have never programed in before!

I went to a bootcamp and learned a shit ton of Ruby and Rails, but now I have to program in Java, .Net, and C#

Any good books out there so I can learn the basics of these languages? I have looked around but wondered what you all thought would be a good idea.
Something witty
Manit0u
Profile Blog Joined August 2004
Poland17875 Posts
Last Edited: 2016-04-03 02:31:03
April 03 2016 02:27 GMT
#14313
For Java you can always read the Thinking In Java book. With C# I'm not sure, I kind of learned it by doing it (not that I had to do much in it, but I did ship a very small program in it that I even got paid for). For .NET/C# be sure to check out the dotnetperls - their examples and explanations helped me immensely when I had only a vague idea of what I should be looking for (and msdn documentations blow donkey balls).
Time is precious. Waste it wisely.
Blisse
Profile Blog Joined July 2010
Canada3710 Posts
April 03 2016 02:59 GMT
#14314
On April 01 2016 23:55 enigmaticcam wrote:
Show nested quote +
On April 01 2016 08:08 Blisse wrote:I can't imagine doing it in SQL but it looks super close to how you would implement union-find/merge :o

What's a union-find/merge?! Man, I need to take an algorithm class so I can know about these ahead of time without having to spend hours to work up my own.


I don't think I learned it during algorithms class. I had to read someone's Matlab code and they were doing something awfully confusing with some trees and indices, and I had to research a bit before I realized they were implementing an algorithm to find all the forests in a tree.

https://en.wikipedia.org/wiki/Disjoint-set_data_structure

Essentially if you have N nodes in a graph, you can label each node from 0 to N-1, and then for every edge (a, b), change all the nodes with label a to label b. The end result is that all nodes in the same forest have the same label number, which means you can easily check if two nodes are in the same forest.

With regards to the SQL algorithm, if we wanted to treat all consecutive dates as belonging to the same data point, then it would represent a forest and we could generate a unique label/id for only those dates, similar to what you've done. Except like, not in SQL :p
There is no one like you in the universe.
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
Last Edited: 2016-04-03 08:05:29
April 03 2016 08:05 GMT
#14315
On April 03 2016 11:59 Blisse wrote:
Show nested quote +
On April 01 2016 23:55 enigmaticcam wrote:
On April 01 2016 08:08 Blisse wrote:I can't imagine doing it in SQL but it looks super close to how you would implement union-find/merge :o

What's a union-find/merge?! Man, I need to take an algorithm class so I can know about these ahead of time without having to spend hours to work up my own.


I don't think I learned it during algorithms class. I had to read someone's Matlab code and they were doing something awfully confusing with some trees and indices, and I had to research a bit before I realized they were implementing an algorithm to find all the forests in a tree.

https://en.wikipedia.org/wiki/Disjoint-set_data_structure

Essentially if you have N nodes in a graph, you can label each node from 0 to N-1, and then for every edge (a, b), change all the nodes with label a to label b. The end result is that all nodes in the same forest have the same label number, which means you can easily check if two nodes are in the same forest.

With regards to the SQL algorithm, if we wanted to treat all consecutive dates as belonging to the same data point, then it would represent a forest and we could generate a unique label/id for only those dates, similar to what you've done. Except like, not in SQL :p

I'm pretty sure you mean all trees in a forest. The naming actually matches the real world counterpart.
If you have a good reason to disagree with the above, please tell me. Thank you.
Blisse
Profile Blog Joined July 2010
Canada3710 Posts
April 03 2016 17:11 GMT
#14316
Errrrrr, true

:p
There is no one like you in the universe.
Prillan
Profile Joined August 2011
Sweden350 Posts
April 03 2016 20:05 GMT
#14317
On April 02 2016 06:15 spinesheath wrote:
Show nested quote +
On April 02 2016 05:02 Prillan wrote:
On April 02 2016 04:02 spinesheath wrote:
On April 02 2016 03:52 Prillan wrote:
On April 02 2016 03:06 spinesheath wrote:
On April 02 2016 02:46 Manit0u wrote:
I always get spooked by such stuff...

That parametric solution for 1... why go to such lengths when you can just use 1 = 1^3 + x^3 + (-x)^3 and still get infinitely many solutions? The same holds true for every single k^3 = k^3 + x^3 + (-x)^3.

Anyways, even though he didn't say so specifically, we can safely assume that there is no easy way to find an upper limit for the 33 case. Or else someone would already have found a solution.

Integer math is surprisingly hard, even though the numbers seem so much simpler than real numbers. In fact many problems are a lot easier if you're looking for solutions in the real numbers instead of integer solutions.

Long story short: if you want to solve this, you should probably head to university and delve into the field of discrete mathematics. It seems like people with way more experience and knowledge in the field than us combined have tried to find a solution.

Well, the equation 1 = 1 + x^3 + (-x)^3 gives you infinitely many solutions, but it doesn't give you all of them. For example, 1 = 10^3 + 9^3 + (-12)^3 would not be included as a solution.

But the formula presented in the video for infinitely many solutions does not include all solutions either.

That's exactly what it does, it's the whole point of it.

The equation 1 = a^3 + b^3 + c^3 has integer solutions a = 1 + 9m^3, b = 9m^4, c = -9m^4 - 3m for all (integers) m.

1 = 1^3 + 2^3 + (-2)^3
What m would produce this valid solution? None of these terms can ever be equal to 2 as far as I can tell.

So for each m this produces a valid solution, but it does not produce all the solutions.

That's a great observation. I didn't see that. I completely agree that it's a weird choice of solutions to present. After doing some short googling I stumbled upon the reason for the confusion.
For example, determine the integers x,y,z  with  |x|,|y|,|z| > 1 such 
that
x^3 + y^3 + z^3 = 1 (1)

This has infinitely many solutions because of the identity

(1 +- 9m^3)^3 + (9m^4)^3 + (-9m^4 -+ 3m)^3 = 1 (2)

but there are other solutions as well. Are there any other identities
that give a different 1-parameter family of solutions? Is every
solution of (1) a member of a family like this?

http://www.mathpages.com/home/kmath071.htm

Note how it says integers x,y,z with |x|,|y|,|z| > 1, something they forgot to say in the Numberphile video. So, if we restrict ourselfs to the, what I assume would be called, non-trivial solutions we end up with (1 +- 9m^3)^3 + (9m^4)^3 + (-9m^4 -+ 3m)^3 = 1 as the easiest way of describing infinitely many solutions to the equation.

As a final note, the page also says this:
However, he says it's not known whether EVERY solution of the 
equation lies in some family of solutions with an algebraic
parameterization.

So as far as we know, there might not be a simple way of describing all solutions to the equation x^3 + y^3 + z^3 = 1.
TheBB's sidekick, aligulac.com | "Reality is frequently inaccurate." - Douglas Adams
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
Last Edited: 2016-04-03 20:29:00
April 03 2016 20:24 GMT
#14318
Scratch that.

It says that a, b, c must be greater than the cubic root of x. So the |a| > 1 is just a special case.

So why does the video present a solution for 20 that uses c = 1? Same thing for 6.
If you have a good reason to disagree with the above, please tell me. Thank you.
Prillan
Profile Joined August 2011
Sweden350 Posts
April 03 2016 20:42 GMT
#14319
Basically, in the video he presents a parametric solution. The reason why that seemingly complex parametric solution is interesting is because it's non-trivial, i.e |x|,|y|,|z| > 1.

The general case does not require |x|,|y|,|z| > 1. Does that make it clearer?
TheBB's sidekick, aligulac.com | "Reality is frequently inaccurate." - Douglas Adams
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
April 03 2016 20:52 GMT
#14320
On April 04 2016 05:42 Prillan wrote:
Basically, in the video he presents a parametric solution. The reason why that seemingly complex parametric solution is interesting is because it's non-trivial, i.e |x|,|y|,|z| > 1.

The general case does not require |x|,|y|,|z| > 1. Does that make it clearer?

Your link does require the equivalent of |a| > 1 for the general case:
each with absolute value greater than the nth root of k
If you have a good reason to disagree with the above, please tell me. Thank you.
Prev 1 714 715 716 717 718 1032 Next
Please log in or register to reply.
Live Events Refresh
BSL
05:00
S23 - Ro16 Group C
TBD vs Dewalt
Ret vs Tech
ZZZero.O198
LiquipediaDiscussion
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
EmSc Tv 14
StarCraft: Brood War
Rain 1649
GuemChi 1047
Artosis 537
ZZZero.O 198
Dewaltoss 71
Dota 2
NeuroSwarm139
Super Smash Bros
C9.Mang0562
AZ_Axe107
ArmadaUGS75
Mew2King36
Other Games
summit1g9677
tarik_tv5410
Grubby2698
Liquid`RaSZi2410
JimRising 352
PiGStarcraft268
syndereN184
ViBE39
Organizations
Other Games
gamesdonequick2392
BasetradeTV128
StarCraft 2
EmSc Tv 14
EmSc2Tv 14
[ Show 14 non-featured ]
StarCraft 2
• Hupsaiya 100
• RyuSc2 60
• davetesta44
• musti20045 41
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Other Games
• imaqtpie991
• Shiphtur329
Upcoming Events
SOOP
10h 3m
soO vs FanTaSy
WardiTV Weekly
12h 3m
Replay Cast
23h 3m
Monday Night Weeklies
1d 17h
PiGosaur Cup
2 days
The PondCast
2 days
GSL
3 days
Replay Cast
3 days
KCM Race Survival
4 days
RSL Revival
5 days
[ Show More ]
BSL
5 days
eOnzErG vs StRyKeR
Cross vs JDConan
RSL Revival
6 days
BSL
6 days
Bonyth vs Doodle
Kyrie vs Jimin
Replay Cast
6 days
Liquipedia Results

Completed

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

Ongoing

Acropolis #5
KCM Race Survival 2026 Season 4
International ShieldBattery League
BSL Season 23
IPSL Winter 2026-27
Calamity Cup Div. A Season 8
Underdog Cup 2026 Div 2-3
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
IEM Kraków 2027
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.