« first day (1 day earlier)      last day (46 days later) » 

12:34 AM
Will fix soon. Finding an arrangement is not always easy.
 
12:59 AM
Fixed.
 
 
11 hours later…
11:39 AM
10 hours and 19 hours left.
for A103.
Using Logo will encounter some difficulty because it doesn't have dictionary or struct or record.
(that's like using C++ std::pair<X, Y> to represent struct {X meaningful_name_1; Y meaningful_name_2; }; ) (or tuple)
So... anyone have Java 6 for Windows?
No problem I downloaded it from Java Archive.
Why must I create an account???
I suppose this is going to beat my previous Java submission again... (that is, longer)
 
12:14 PM
Are all answers fixed now?
(except HyperNeutrino A103)
 
 
2 hours later…
2:29 PM
you mean A109 but yes
 
3:12 PM
Hurry up, I also need to debug...
 
hurry up with what?
 
next sequence. My time is limited.
 
3:27 PM
my plan was to work upon Hyper's A109, but instead of solving A103 I found that his answer needs correcting
however, I'll try to solve it anyway
 
I am doing it in Java 6, but to be safe it's better to have backup plan.
 
3:54 PM
I think I'm going to be awake at night complete my program like HyperNeutrino...
Certainly more (or less?) stressful than when you are in a programming contest, there are 5 minutes left and you have an idea how to solve a problem.
 
4:27 PM
Almost done...
 
@user202729 That's great!
 
4:48 PM
Done, hopefully correct.
Forgot to filter by [all nodes has degree >= 4]...
run:
1
Exception in thread "main" java.util.ConcurrentModificationException
	at java.util.AbstractList$Itr.checkForComodification(AbstractList.java:372)
	at java.util.AbstractList$Itr.next(AbstractList.java:343)
	at oeis_challenge.A000103.generateGraph(A000103.java:234)
	at oeis_challenge.A000103.evolve(A000103.java:302)
	at oeis_challenge.A000103.main(A000103.java:322)
I didn't do anything...
related to threads...
Oh, my fault.
 
How is it going guys?
(Best of look :P)
 
Coding. It's 12 AM at my timezone.
 
Indonesia?
Or somewhere around there
 
5:04 PM
AssertionError
 
5:22 PM
Bugs after bugs...
1 -> 0 now! Yay!
AssertionError again...
Progress
https://tio.run/##tVrvbhs3Ev8sPQVT4BopkteSnXyoZfsa5NI2QNICl@C@GEJA7dISpdWuusuVrRZ6jnuge7DczPDPkquV4t61ASKvyJkh5w@Hv5nVkm/5Wb4R2TJZfffly/k52/B4xeeC5UKWn@MFT1ORzcWk25XrTV4otgSOqFIyjV4XBd@9l6WaHM4dGX6XiExJtfuJl4sPfNNC8THmWSYKWG9TzVIZszjlZck@cJmx37udbge2mAgYLGQ2Z2Irip1a4KMhlyXLcsU4m@d5wmQi@JDNKsXesU2Rr2Up4OlBpikJQkoYq2BULcQ6Yj/kBROPfL1JaYS9TcAS91KkSckWohCsXORVmrCZAHFyy5UgOTxLkDyYnwulRFFG3U6puHKKkERQpEMPmXhUQxAltkOmHmQ2gQmZKdhYIiaGqGcH@sTXAXXLCL@zG0e3twI3XBY/g9AefQtZYBhYxISJCFeEZxxH9k4hVFVk7nsg7hPsq0UcbteKM88nxO3RdYEhfiz4ZgHyYP78xQv4ZC/Ym4WIV@DCfJ0XG2BegyHVgxAg6iFnc@Qoh6wQsP0SAkkkjJeMJ0
Before remove edge [1, 4]:3 -> 1 -> 2
3 -> 2 -> 0
0 -> 2 -> 1
4 -> 0 -> 2
4 -> 3 -> 0
2 -> 3 -> 1
0 -> 3 -> 2
2 -> 0 -> 3
4 -> 1 -> 3
1 -> 2 -> 3
1 -> 4 -> 0
3 -> 4 -> 1
0 -> 4 -> 3
3 -> 0 -> 4
2 -> 1 -> 4
1 -> 3 -> 4
5 =======
After remove edge:
3 -> 1 -> 2
3 -> 2 -> 0
0 -> 2 -> 1
4 -> 0 -> 2
4 -> 3 -> 0
2 -> 3 -> 1
0 -> 3 -> 2
2 -> 0 -> 3
2 -> 1 -> 3
1 -> 2 -> 3
3 -> 4 -> 0
0 -> 4 -> 3
3 -> 0 -> 4
1 -> 3 -> 4
5 =======
^ remove edge is problematic.
3 -> 4 -> 0 after remove edge is problematic.
 
5:43 PM
@user202729 holy sheet this is a very good case of self-documenting code. When you finish you should submit this to the OEIS and mention all relevant sequences.
 
But it's terribly slow :(
And I'm afraid that I will never finish.
4 hours left and it's 12:45 at night in my timezone.
@NieDzejkob Help me?
And document the code (probably) make my coding speed slower :(((
Chat on SE too.
But I can't find ANY flaw with the removeEdge or pairNext.
To be self-documenting I should probably include some ASCII-art plots.
 
so the Edge class implements cycles using a singly-linked cyclical list?
 
doubly connected edge list
 
what is the twin field for?
 
The doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the plane, and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces). It is used in many algorithms of computational geometry to handle polygonal subdivisions of the plane, commonly called planar straight-line graphs (PSLG). For example, a Voronoi diagram is commonly represented by a DCEL inside a bounding box. This data structure was originally...
The orange one.
(sorry for the oneboxes)
 
5:55 PM
@user202729 It's not TNB, oneboxes are fine :P
 
what even are oneboxes?
 
Ignore it, focus on DCEL.
 
Where a link auto-expands (such as challenges, or wikipedia links)
 
@cairdcoinheringaahing Please, give me 1 more days or I will get into trouble, it's 1AM here...
 
@user202729 Sorry, I can't really change the rules just to save the challenge, but it isn't a big deal if an answer wins, the challenge can still continue (and most answer chaining problems do)
 
6:01 PM
So what went wrong...!!!???
 
:41602300 			twin.prev.pairNext(edge.next);
			edge.prev.pairNext(twin.next);
 
3->4->0 is correct, but still assertion failed.
@NieDzejkob What? Let me see..
 
aren't you mixing these two cycles or something?
 
Oh no I'm stupid...?
 
6:02 PM
I would expect this to be twin.prev.pairNext(twin.next), tbh
 
No, that's correct.
 
I have next to no experience with graph manipulation, but
 
I assert that this is correct. So the problem is at other parts...
 
do you add the twin edges to the edges list when initialising?
 
Yes.
Look at addvertex and constructor.
https://tio.run/##tVrhkho3Ev4NTyFvlWMI7Czs2j@y7O5l43MSV9lJ1dl1fzjKJRgBgkHDzQh2SYrnuAe6B/N1t6QZaRjYTV3iKrOD1N1Sd3/d6taw4Ft@nq6FWsTL775@XfPJks8ES4XMv0zmPEmEmolBsylX6zTTbAHk0UbLJLrPMr77IHM9OJw7Mvw@FkpLvfuZ5/OPfF1D8WnClRIZrLfejBM5YZOE5zm77/V6/d4V@73ZaDYuLlgsYDyTasbEVmQ7PcdHyyFzplLNOJulacxkLHiXjTeavWfrLF3JXMDTg0wSEoSUMLaBUT0Xq4j9mGZMPPLVOqER9i4GY0ylSOKczUUmWD5PN0nMxgLEyS3XguRwFSN5MD8TWossj5qNXHNd6EISQZEGPSjxqLsgSmy7TD9INYCJqVQ8YVJp2F4sBpa05QbaxN0ApfMIv7Pbgm7vxK65zH4B0S36FrLAMLCIARMRrgvPOI7sjUzoTaaK74G4z7C7GnG4aSfOPp8Qt0cHBub4KePrOciD@Ytvv4VP9i17OxeTJTgyXaXZGphXYE79IASIekjZDDnyLssEbD8HRImY8ZzxeME
			newgraph.removeEdge(edge); newgraph.removeEdge(next);
			Edge[] circuit = newgraph.findCircuit(next, 5);
^ remove and then find circuit. I'm stupid again...
And prev is unused.
 
6:09 PM
make sure you always use removeEdge instead of edges.remove too
(however I didn't find such a case)
@cairdcoinheringaahing maybe the deadline should depend on whether the sequence is tagged hard?
 
@NieDzejkob It may be waaay to late to add that rule :P Besides, the challenge has to end at some point, and if I keep adding rules to prevent that, it'll take the fun away from it for some users: "If he keeps delaying the end, what's the point of continuing?"
 
https://tio.run/##tVrvbts4Ev9sPwVbYLdW4yh20n7YOMltkM3uFugf4Frcl8AoaIuxacuST6KceBd@jnuge7DezJCUSEl2UtxugToyOTPkzPxmOEN5wTf8OF2LZBEtf/r2bc2nSz4TLBUy/zqd8zgWyUyMul25WqeZYgsgDwsl4/A6y/j2vczVqDm3Z/hdJBIl1fZ3ns8/8HULxecpTxKRwXrrYhLLKZvGPM/Z9WAwGA7O2J/dTrdzcsIiAeOZTGZMbES2VXN8NBwyZ0mqGGezNI2YjATvs0mh2Du2ztKVzAU8Pcg4JkFICWMFjKq5WIXs1zRj4pGv1jGNsNsIjHEvRRzlbC4ywfJ5WsQRmwgQJzdcCZLDkwjJvfmZUEpkedjt5IqrUheSCIp06CERj6oPosSmz9SDTEYwcS8THjOZKNheJEaGtGcHAuLugNJ5iN/ZZUm3s2LXXGYfQXSPvvksMAwsYsREiOvCM44jeycTqsiS8rsn7gvsrkUcbtqKM88HxO3QgZ45fsv4eg7yYP7k9Wv4ZK/ZzVxMl@DIdJVma2BegTnVgxAg6iFlM@TI@ywTsP0cECUixnPGowW
faulty addVertex now
 
A good thing to keep in mind is: It doesn't matter when the challenge "ends", because there's nothing stopping users from continuing to add answers.
 
PRE ADDVERTEX
4 -> 0 -> 1
3 -> 1 -> 2
2 -> 1 -> 0
1 -> 2 -> 1
4 -> 3 -> 0
0 -> 3 -> 1
1 -> 0 -> 3
4 -> 1 -> 3
1 -> 4 -> 0
3 -> 4 -> 1
0 -> 4 -> 3
3 -> 0 -> 4
0 -> 1 -> 4
1 -> 3 -> 4
5 =======
4 -> 0 -> 1
5 -> 1 -> 2
5 -> 1 -> 0
5 -> 2 -> 1
4 -> 3 -> 0
5 -> 3 -> 1
5 -> 0 -> 3
4 -> 1 -> 3
1 -> 4 -> 0
3 -> 4 -> 1
0 -> 4 -> 3
3 -> 0 -> 4
0 -> 1 -> 4
1 -> 3 -> 4
3 -> 5 -> 0
1 -> 5 -> 3
2 -> 5 -> 1
1 -> 5 -> 2
0 -> 5 -> 1
1 -> 0 -> 5
0 -> 3 -> 5
3 -> 1 -> 5
1 -> 2 -> 5
2 -> 1 -> 5
6 =======
^ error log
Huh, 1 -> 2 -> 1?
 
And @NieDzejkob You get +100 when the deadline is met :P Also, if there's no deadline, harder sequences can be addressed with less stress and coded better :P
@user202729 You could ask on Math.SE
 
6:18 PM
It's pretty irrelevant.
And I'm doubtful Math.SE can help in 3~4 hours.
Hopefully correct.
 
Hey Hyper o/
 
hello
I'm in french class so I don't think I can do much right now and I won't be available much this afternoon or evening
 
2->1,3->1.
4->2!
5 is running...
@HyperNeutrino You post it, I have to sleep now.
https://tio.run/##tVpRc9s2En6WfgXy0EaKZVqyk4datq8eX9pmJmlnLpl78WgykAhLkEhQJUHZake/437Q/bDc7gIgAYpSnLn2wTIF7C6wu98udkEt@YafZmuhlvHqhy9fZLrOcs2WMBqVWibRbZ7z7XtZ6HF3b@7A8LtYKC319hdeLD7wdQvFxxlXSuTjbnddThM5Y7OEFwX7wKVif3Y73c7ZGYsFDOZSzZnYiHyrF/hoyWXBVKYZZ/Msi5mMBR@waanZO7bOs1QWAp4eZZKQIKSEsRJG9UKkEfspy5l44uk6oRH2Np4L9iBFEhdsIXLBikVWJjGbChAnN1wLksNVjOTB/FxoLfIi6nYKzXWlCEkERTr0oMSTHoAosRkw/SjVGCYepOIJk0rD9mIxtqQ9N9An7g4oXUT4nV1XdDsnds1l/iuI7tG3kAWGgUWMmYhwXXjGcWTv5EKXuaq@B@I@we5axOGmnTj7fETcDh0YmOPnnK8XIA/mz169gk/2it0txGwFjszSLF8Dcwrm1I9CgKjHjM2Rox
 
@user202729 Is it working?
 
For 0~4. 5 is running.
 
6:27 PM
You are our hero user202729!
 
In Java 6.
 
@user202729 Why don't you post it now?
 
I have to sleep
 
Has Java 6 been used?
 
No.
 
6:53 PM
any takers for posting user202729's solution? i don't really want to post someone else's work :p
 
I'll post it as a CW if no-one else does
 
Community wiki
 
@Mr.Xcoder Mhm
 
(remember the offset)
 
that's accounted for
(you mean 0-indexing right)
 
7:08 PM
waits for the notification :P
 
7:30 PM
huh, not a single Labyrinth answer yet
time to fix that...
hm, except the first unused size is 104 and my basically ungolfed solution is 19... that would be quite a stupid amount of padding
 
That is one of the problems of late answers, they often have an insane amount of padding :/
 
well it's not like it's an unfixable problem... it would just make more sense to use a more verbose language now that gets closer to those 104 bytes naturally (or even beyond that) and keep languages like Labyrinth for other problems that need more code anyway.
like Mornington Crescent might be a good idea for the next one
this actually seems fairly doable. 18 is 7 + 7 + 4 (which you can get from Seven Sisters and Heathrow Terminal 4), squaring is built-in, and you can get a 2 from Heathrow Terminal 2. That only leaves the branch for n=0, which shouldn't be too bad though.
oh right, already too late anyway
 
 
1 hour later…
9:05 PM
And the only one on that list with <100 votes :P
 

« first day (1 day earlier)      last day (46 days later) »