One OEIS after another

user202729

00:34

Will fix soon. Finding an arrangement is not always easy.

user202729

00:59

Fixed.

user202729

11:39

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)

user202729

12:14

Are all answers fixed now?

(except HyperNeutrino A103)

NieDzejkob

14:29

you mean A109 but yes

user202729

15:12

Hurry up, I also need to debug...

NieDzejkob

hurry up with what?

user202729

next sequence. My time is limited.

NieDzejkob

15:27

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

user202729

I am doing it in Java 6, but to be safe it's better to have backup plan.

user202729

15:54

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.

user202729

16:27

Almost done...

NieDzejkob

@user202729 That's great!

user202729

16:48

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.

Mr. Xcoder

How is it going guys?

(Best of look :P)

user202729

Coding. It's 12 AM at my timezone.

Mr. Xcoder

Indonesia?

Or somewhere around there

user202729

17:04

AssertionError

user202729

17:22

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.

NieDzejkob

17:43

@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.

user202729

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.

NieDzejkob

so the Edge class implements cycles using a singly-linked cyclical list?

user202729

doubly connected edge list

NieDzejkob

what is the twin field for?

user202729

Doubly connected edge list

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)

caird coinheringaahing

17:55

@user202729 It's not TNB, oneboxes are fine :P

NieDzejkob

what even are oneboxes?

user202729

Ignore it, focus on DCEL.

caird coinheringaahing

Where a link auto-expands (such as challenges, or wikipedia links)

user202729

@cairdcoinheringaahing Please, give me 1 more days or I will get into trouble, it's 1AM here...

caird coinheringaahing

@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)

user202729

18:01

So what went wrong...!!!???

caird coinheringaahing

In what?

NieDzejkob

:41602300 			twin.prev.pairNext(edge.next);
			edge.prev.pairNext(twin.next);

user202729

3->4->0 is correct, but still assertion failed.

@NieDzejkob What? Let me see..

NieDzejkob

aren't you mixing these two cycles or something?

user202729

Oh no I'm stupid...?

NieDzejkob

18:02

I would expect this to be twin.prev.pairNext(twin.next), tbh

user202729

No, that's correct.

NieDzejkob

I have next to no experience with graph manipulation, but

user202729

I assert that this is correct. So the problem is at other parts...

NieDzejkob

do you add the twin edges to the edges list when initialising?

user202729

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.

NieDzejkob

18:09

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?

caird coinheringaahing

@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?"

user202729

https://tio.run/##tVrvbts4Ev9sPwVbYLdW4yh20n7YOMltkM3uFugf4Frcl8AoaIuxacuST6KceBd@jnuge7DezJCUSEl2UtxugToyOTPkzPxmOEN5wTf8OF2LZBEtf/r2bc2nSz4TLBUy/zqd8zgWyUyMul25WqeZYgsgDwsl4/A6y/j2vczVqDm3Z/hdJBIl1fZ3ns8/8HULxecpTxKRwXrrYhLLKZvGPM/Z9WAwGA7O2J/dTrdzcsIiAeOZTGZMbES2VXN8NBwyZ0mqGGezNI2YjATvs0mh2Du2ztKVzAU8Pcg4JkFICWMFjKq5WIXs1zRj4pGv1jGNsNsIjHEvRRzlbC4ywfJ5WsQRmwgQJzdcCZLDkwjJvfmZUEpkedjt5IqrUheSCIp06CERj6oPosSmz9SDTEYwcS8THjOZKNheJEaGtGcHAuLugNJ5iN/ZZUm3s2LXXGYfQXSPvvksMAwsYsREiOvCM44jeycTqsiS8rsn7gvsrkUcbtqKM88HxO3QgZ45fsv4eg7yYP7k9Wv4ZK/ZzVxMl@DIdJVma2BegTnVgxAg6iFlM@TI@ywTsP0cECUixnPGowW…

faulty addVertex now

caird coinheringaahing

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.

user202729

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?

caird coinheringaahing

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

user202729

18:18

It's pretty irrelevant.

And I'm doubtful Math.SE can help in 3~4 hours.

Hopefully correct.

caird coinheringaahing

Hey Hyper o/

HyperNeutrino

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

user202729

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…

caird coinheringaahing

@user202729 Is it working?

user202729

For 0~4. 5 is running.

Mr. Xcoder

18:27

You are our hero user202729!

user202729

In Java 6.

Mr. Xcoder

@user202729 Why don't you post it now?

user202729

I have to sleep

caird coinheringaahing

Has Java 6 been used?

Mr. Xcoder

No.

HyperNeutrino

18:53

any takers for posting user202729's solution? i don't really want to post someone else's work :p

caird coinheringaahing

I'll post it as a CW if no-one else does

Mr. Xcoder

Community wiki

caird coinheringaahing

@Mr.Xcoder Mhm

NieDzejkob

(remember the offset)

HyperNeutrino

that's accounted for

(you mean 0-indexing right)

caird coinheringaahing

19:08

waits for the notification :P

Martin Ender

19:30

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

caird coinheringaahing

That is one of the problems of late answers, they often have an insane amount of padding :/

Martin Ender

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

caird coinheringaahing

21:05

19 answers needed to become third most answered challenge

3

And the only one on that list with <100 votes :P

Transcript for

One OEIS after another