#programming
1 messages · Page 235 of 1
ofcourse it got used as the intro to pootis engaged, but the song itself is about thighs
Imma just perish
the song is a banger tho, ill just pretend i don't know
cheese has a job? 
Whattt that's crazyyy I work, wild
helvetica staaaandaaaaaard
floating point error vedal
Looks like FanControl got rid of the WinRing0 driver
i don't think this pawn is quite free anymore
yes, a while ago
Windows started cracking down and labeling anything with winring0 as a trojan
Looks like they are training a AI to train it self to do autonomous real world tasks.
Instead of actually training the AI with real scenarios and spend a ton of compute and time, you will be able to pass videos to the AI, and then it will start a process of "imagining" itself doing the task and learn it alone.
In this example they used Minecraft, showing that it was able to mine a diamond by itself, with no AI was able by now. (not even neuro)
For now it's just a technical paper, but it might be interesting to follow the project. Perhaps Neuro can benefit from it in the future and become a better gamer with much less effort from Vedal
https://danijar.com/project/dreamer4
Introducing Dreamer 4
Dreamer 4 is an AI agent that learns to collect diamonds in Minecraft by training in its own imagination using a world model.
It is the first agent to mine diamonds learning entirely offline, without needing to practice in the actual environment.
Find out more: https://danijar.com/dreamer4
that's the video generated for training tho 
I only noticed it now since I apparently ignored FanControl's update notifications for a while and I've been like 10 versions behind...
Either way, better later than never ig
Oh 
Wait but
Whats the point
Is this video ai generated?
Ai made training video for another ai
Did i get it right
Why did you say it "was able to mine diamond by itself"
Or there is no evidence/footage of the ai actually doing it
I splashed out on my first really fancy keyboard 
Do I need it? Probably not. But do I want it... Yes 
I always tell myself the custom keyboard I've built for way too much money is worth it because of how much I use it 
not even an HE something my head
I don't need the features of HE, and I prefer tactile keys.
But I did look into it (but holy, the price
)
do they make good low-profile (or how is it called? when the buttons are not 3cm towers but flat like in laptop)
I think Windows no longer accepts the WinRing0 driver
it always seemed to me that they only make "normal" keyboards like that
i mean high quality and all
They do have a couple low profile options, but I can't speak for their quality
Yeah I recall Defender blocking it
Indeed
Haven't had to deal with this personally since I use ESET instead of Defender
I don't have to deal with that stuff anyway since I do not use Windows
I tried Linux several times, it's just not a good fit for my home PC unfortunately
Always something that's borked
I was even installing some Linux distro that seemed to be popular recently (CachyOS) and it really didn't give me a good first impression when the system installer crashed with a Python error soon after it started installing...
it always was in the vulnerable driver list, wasn't it?
Cherry has some really interesting low profile switches but idk any pcb that accepts them
a lot of this is also just the keycaps tbf
linux wouldn't be linux if you could find a distro with just the right colour and taste
Windows does this now with anything with winring0
you can obviously create an exception and force it, but there's a reason Microsoft added this to Win Defender
I've tried like a dozen by now 😭 only so much time I'm willing to burn for trial and error
this is the fourth time my iems made that sound today
this must be all in le head
Only recently started getting actually blocked
anybody knows how to stop my program from any point of a program
and not call exit; until i get to the main
on every subfunction
oh shit division by 0 actually works
ok but now it dies before the message arrives
any logs....? without logs there's no way to know what's wrong
could even be a network card issue that crash the system(especially mediatek ones)
I only got a photo of the error, one sec
When I chose GRUB instead of systemd-boot, it installed fine
try normal... well I mean generic distros like archlinux(which cachyos is based on?)?
Meow
that's the fault of that installer I guess
Happy birthday @topaz tendon
I haven't tried bare Arch, but from memory I tried: Ubuntu and some flavors, Debian, Mint, Manjaro, Antergos, Fedora, and probably something else I missed
Thank you <3
did they have similiar errs related with partitions or mounting?
Nah, Cachy is the only one that crapped out during the installation process. Other distros had other things wrong with them, not necessarily errors, just configuration/performance/stability problems
Some of those go several years back so I can't give you the details, but generally I've had issues with getting VRR working, mouse movement in games being iffy, and some other things
could this help...? https://wiki.archlinux.org/title/Variable_refresh_rate
I did research my problems, no worries
If I recall correctly, VRR was something that was temporarily broken by Nvidia's proprietary driver
Trying to get an older one than what's in the repos was a mess so I let it go
mouse problems could be related with so many things
if that's windows games sometimes it's even wine/proton's problem
did the nvidia-open driver help?
it did improve a lot
The main one was TF2, which happens to run natively. I tried several tweaks to change that, incl. disabling mouse acceleration globally in some configs etc.
I don't think nvidia-open was a thing back when I was testing this
No, my bad
I got confused because I thought that the print screen was some hallucination of the AI, like in that minecraft gameplay generated by AI. But it's just very low resolution
The print screen that you took was in fact buttons crafted by the AI.
The AI in the video is actually playing minecraft and mined a diamond
nice 
my negamax gives away his queen on turn 5

surely static board was great after that 
I don't know, I would throw a special custom throwable and catch specifically that in the main
what the hell they literally
trade ANYTHING to get a check
queen for rook + check? best move ever
bishop for rook and check? great, too bad i cant trade my queen for that
does this negamax even work
is this a trolling
i think if i tell it to choose the worst move they will actually do better
no it does even worse
hbd
also interesting pfp choice
people in replies saying it’s a damaged screen 
Thank you, and thank you :)
eliminiminiminate
minimum fieryrage
drop it like an elevator 🗣️🗣️🗣️
anyone here good with typescript?
well i might need help fixing up an extension
for vscode
if you got time
@rigid snow
i think its better if we call since i can stream whats going on
so call me when you're ready
server vc doesn't suffice
am bored
yeah this is what i am working on currently
devil may cry

man this guy got typescript extension
well yeah how else are you gonna mod vscode?
I mean ig you could wasm or just idk distribute binaries from other langs and make ts bindings for it?
it got automatically downloaded but i didn't care because whatever
helped out alot ngl
actually does vscode's node even support wasm
how do i sort one array based on another array
they are of equal size
is it o(999)
(idk what o(x) means)
oh it was added since 2020, interesting
wonder if wasm types were added tho
i feel like bubble sort is slow and sucks
Use qsort from stdlib?
https://www.w3schools.com/c/ref_stdlib_qsort.php
but i will need to sort another array
i need 2 arrays sorted by 1 array
hmm actually
it can take function
so i need to give it some kind of pairs
nah this qsort cant sort pairs
i gotta use my shitbox bubble sort i guess
it probably can but im too bad
go read docs
wrong code
also idk why i need to copy them
you are so smart 
cant . on ptr
will it work
can -> or *
a->b is just (*a).b
ok so qsort says "i cant take compare which has pairs wtf is that"
read what errors compiler gives
use sort not qsort
sort says same thing but phrases it differently
or maybe i need change arguments
that different thing 
it doesnt say which argument it doesnt like
read std sort docs 
it just says "bad arguments
this is unreadable https://en.cppreference.com/w/cpp/algorithm/sort.html
i hate this website
that not on pair
i googled vlas this word doesnt exist

In computer programming, a variable-length array (VLA), also called variable-sized or runtime-sized, is an array data structure whose length is determined at runtime, instead of at compile time. In the language C, the VLA is said to have a variably modified data type that depends on a value (see Dependent type).
The main purpose of VLAs is to si...
this not use
use vector
its safe here
what can go wrong
does it not deallocate it
automatically when i exit
i dont change its length ever again
you barely know the language 
its bad when you want to change it but its not the case, len_submoves is const within this entire function that uses this array
therefore i can use it freely here
am i wrong

i have at least 10 vlas and it works fine
because every array even though being of "variable" length
is declared once and never changes length within scope
g++ builds it and i didnt care before
now idk what to do 
vector cant take move
this is stupid i'll just use my bubble search which actually works
and not these lambda bullshit
maybe i'll research it later
end and begin arent even pointers they are just index number what the hell
how does sort know what array to change
of course it cant take pair
it probably uses 5000 line of code decoding of its arguments
wanf use c++ learn its complexity
too hard
They're iterators. Sort of an abstract representation of a position in a data structure.
Well not "sort of".
yeah
so sort() which i call doesnt even know which array it plays with
because it takes end and begin iterators, and function to compare
but its supposed to work because i guess it takes those arguments and strips it from .end and does something else
but then i cant give it just any datatype
it surely can sort normal arrays but when i give it pair it says
"i cant sort this"
actually not waht it says it says it has no end
wait so i can just give it 0 and len_submoves
guess what you are sorting?? idk lets see
yeeeah it cant do shit with it
If you want to sort a regular C-style array you can just give it pointers to the beginning and end. pointers can be used as iterators.
i have 2 arrays
one is moves
the other is values of moves
i need to sort moves by their values
basically sort 1 array by values of another array
Can you turn it into an array of pairs and sort that?
i struggle to give it .end and .begin of pair so it understands it
array of pair doesnt even have end or smth i dont get it
Use &array[0]' and &array[len_submoves] instead.
Or array+0 and array+len_moves to save tokens. 😛
it gets 500 errors trying to parse this anyway
actually just 2
ok i figured it out
so actually compare() function has to take actual datatypes of something being compared and not their pointers
sort() can take pointers and not end() or begin() while all examples ambiguously give .end and .begin examples
thank you all for help 
i just got shared a file in onedrive form one of my throw-away alts 
it doesn't even contain a virus, its just a shitpost 
the file is from 2018
weird, anyways
Just been working on making my own first AI. Found it was not displying the way I wanted. Was using Vseeface, kept tracking my movements and saw no expressions being used.
it doesnt sort anything
whyyyy
it actually does change order but its not correct
what is wrong with this
first of all there is no element move_and_score[len_submoves] but idk if it wants the start of last element or the end of it
i guess it should be start so i put -1 before ]
then it still gives something like this
len_submoves is a runtime value. In C++ you have to give a compile time constant to size an array.
Ah, right.
why is it even a problem
also i think i fixed it
in compare i had to put < instead of -
and it actually wants &move_and_score[len_submoves]
even though this pointer is out of bounds of array
Yeah, because that's how iterators work. The end element is the one just outside of the range.
c++ vlas nonstandard extension
is it banned in competition
Also regarding the < vs - thing that's a difference between the C qsort and the C++ std::sort.
do i have to switch to vectors
You can stick to arrays if you size them large enough that it doesn't matter. I size all my moves arrays to take 256 elements. That's more than the chess board with the most known legal moves.
but these arrays are local to each function that uses them
Yeah, they get put on the stack.
and im not changing their size ever
so current negamax destroys all my previous bots
i guess i wont even submit that garbage then
its not about complexity of cpp its about ambiguousity of things people created using it 
oh but actually this negamax is much worse in finding mate
i should work on that
why can't people just use c, are they stupid
its too limiting
no oop
wtf is that
what is this, 1984?
(im not using anything from oop in my bot though)
unless you counter that sort class-like
wdym "no oop", structs and unions is enough to make everything else
you can put a function pointer in it
mhm i guess
That's pretty much what C++ does. Every object with virtual functions stores a hidden member variable with function pointers. You can do the same with C but it's more tedious.
In object-oriented programming such as is often used in C++ and Object Pascal, a virtual function or virtual method is an inheritable and overridable function or method that is dispatched dynamically. Virtual functions are an important part of (runtime) polymorphism in object-oriented programming (OOP). They allow for the execution of target fun...
have you heard of a vtable 
it probably looks so messy
it usually looks like obj->func(obj, ...);
you might choose to have a separate struct for the vtable so the syntax varies on how you approach it, i prefer to declare a Obj_func(Obj *this, ...) and call that so i don't have to worry about the vtable whenever i call things
i don't think he checks this channel that often

he might be more active in #neurotic-neurons but there's no guarantee he'll see it
remember to not ping him tho
you ping tutel you go bye bye
shiro can attest to that
Can i try pinging ved
✅ 
wait, does he?
thx
brother you're 13, life hasn't even started yet
He lives in the UK
yuh
someone doxx vedal so that we know where he lives 
bro got the most typical UK kitchen set for the irl videos
100ms is slower than our reaction speed 
talk for yourself
my reaction speed is approximately 3 years
you reacted to my message under 3 years

yuh
I actually got a 40.25(iirc) seconds on the classic sheep fricker seed
didn't bother to post it
wanted to get a sub 40 first
40.082 my bad

fucking 2 ticks man
if I can spend less on crafting
Where would I even obtain this specific model?
I have been informed there is an even more powerful model than the one I am using and I need to figure out what it is
uhh iterative search and transposition tables look scary
it's quite simple
do i just compare my current hash with all transposition table entries
it seems to be extremely slow
you make a table
search for position in table
if it's stored, find the node type and set its lowerbound(alpha), higherbound(beta) or exact value to the current search(of individual nodes)
store new node to the transposition table
yuh
the zobrist key
yuh
it represent the board, the unique position(there will be hash collisions but whatever)
you can just obtain the position by transposition_table[zobrist_key]
that'll do the job

doesnt it do the same
well it won't cause you time to iterate 10000 elements per search
it's a hash table, your compiler will do the job for you
wuh
like
vector[position]=value
but my vector is empty
i have to make it [64bit]
vector[zobristKey] doesn't exist
i meant figuratively
but if i push back it all becomes random
it is random
transposition_table[0] is 3412412313123
transposition_table[1] is 312310391089231032109388091
but it represent a board state
oh wait you're using vector FUCK
this cant be right i am not getting something

i can use something else
i used vector because it has nice pushback and is supposed to work well with dynamic length arrays
which is exactly my case since im going to push back thousands/millions of times
you need to implement your own table thingy
i cant understand how it can work if i dont create transposition_table[18 446 744 073 709 551 616] right away
you don't, just get your value stored as 123, and the key as abc
but then i have something like
hash1 : {1312}
hash2 : {31232113}
hash3 : {31}
i give it hash and it has to iterate through all hashes just like i did
since hash1,2,3 are ALSO random numbers
it would only work if i had 18 446 744 073 709 551 616 length array
so i just get hashX position from it right away
I don't understand

so i have
a table which has
hash(random number), value(random number)
i want to find if new hash is stored
so i get my current hash
i do not understand indeed
nono its like
lets say i tested 2 boards
my current transposition table is
{1312313132113312, -3333}
{12313193242342341, 4000}
i want to test if my new hash (lets say its 12313193242342341) is in the table

how do i check if its in the table if all table contents are random
and i have random number as input to the search
i mean i know how i do it
i just iterate through entire table
nah you just call std::unordered_map::find, it's O(1)
how else can it be possible, to find random number in random number table?
if std::unordered_map::find == std::unordered_map::end 
true if present false if not
it's that shrimple
for find you pass in your key as argument
i would understand if it was ordered on push_back but its not
so vector is dead way
define your struct with only the valuation for now.
your unordered_map definition should be unordered_map<uint64, transposition>
vector is not used for such case
you should be using a key-value map
vectors are arrays, here you should be using a dictionary(in Python's language)
yes vectors are not ordered


so the trick is to put hashes in order

?????
noooo i mean how does it work at all
how can it be possible
find random in random list
without iterating through all
the list has to be ordered!
no?

no
^^^ if you want to find is a key present in the map
Huggingface
Pcunwa>kim-mel-band-roformer-ft
If the instruments are loud compared to the voice, it can start to get muffled
Big beta 6x has a little more fullness for those, but it doesn't have as high of a bleedless score (mel-band-roformer-big)
For removing reverb, search anvuew mel band
However, any voice not in center channel kind of just gets removed..
whatever im tryin to do this now
Hmm
How does MB-Roformer-InstVoc-Duality-V2 compare?
https://www.geeksforgeeks.org/cpp/unordered_map-find-in-c-stl/
go grab your Geeks for Geeks here
so i do something like this

insert to add entry
im getting confused with names
:YES:
I mean, well it has to

the hash is the chess board hash
doc I look at says "Outperformed in both metrics by the unwa’s Kim FT"
ah, then yeah that's fine
Hmmm
idk if that little {} would affect the result or not
https://youtu.be/OnkXWkvLSkc
I'm trying to find the model matching what is used here, and so far my best match is that one I mentioned
This is a fan-made epic orchestral cover of ‘GODS’ by NewJeans, covered by Neuro and Evil.
The original Neuro & Evil cover was created by pb and Vedal.
【 CREDITS 】
✧ Vocals:
Neuro - https://x.com/NeurosamaAI
Evil - https://x.com/EvilNeuroAI
✧ Orchestral Arrangement: Carlos Alvarez
https://www.youtube.com/@CarlosAlvarezEpicMusic
...
it might be treating it as an array instead of two parameters
it doesnt work without it
My result
remove the {} and make a habit of using emplace in place of insert
i wonder if the zobrist hash itself is random enough to use it as a hash function for the map
though i guess at that point you're better off just making your own hash table 
(emplace constructs the object for you efficiently, while insert expects an object to be constructed separately)
it also saves 2 tokens
:3
Zobrist hashing is the first known instance of tabulation hashing. The result is a 3-wise independent hash family. In particular, it is strongly universal
hmmm, sounds like it could be fine
sounds pretty high bleedless, that's good
they are the same smh
no it's not

It has slight manual cleanup (pasting one part from the result over an earlier identical part)
doesnt work without {}
the collision probability is definitely higher than the built-in hash function for hashmap

or maybe visual code is lying
ok ok
But the question is how well does it match the reference?
the performance impact in this case is negligible since i think insert has an override for std::pair<K, V> &&
but you do save 2 tokens with emplace :3
or use python, more token saves 
wait so first i have to check if this hash exists at all
and only then i take its value
what the hell does it return
or just use std::unordered_map::at if you're fine with it crashing if the hash doesn't exist
an iterator
you will obtain transposition_table::end from transposition_table::find if your table does not have that specific key
you can check afterwards
no biggies

for token saving purposes just write auto test = ...; :3
i sure love getting iterators of length 1 back
then like caibi said, compare it with transposition_table.end() and then you can read the value with ...::operator*() (aka dereference operator it)
it is defined
i dont know its type
susge
this one has slightly less noise, however, possibly slightly less fullness? hard to tell, and I only listened for like 30 seconds
i mean
i dont want to .find 10 times
first to check if its there
then to get its value
but looks like im wrong and getting value does not require .find
is aur down
Hmmm
so this is correct?
(i check if its in theere)

that is correct yes, obv you won't get the iterator from it though
if all you need to do is check if it exists, that works
i have no idea what these functions return
what kind of datatype is this
truly,
skill issue
a node handle 
pointers
for the future, if you're ever unsure how to use a function the cppreference has examples for pretty much all of them
it doesnt suggest anything 
you don't -> it
yis
the dot 
but then that creates a value at that key if it doesn't already exist
which might be an unwanted side effect

you already checked if it exist smh
i check if it exists first and dont try to read it
so much work
just put std::unordered_map::at in a try-catch block and call it a day, ez

is faster than my for_each
while everything is random
¯_(ツ)_/¯
I still like big beta 6x, has so much more fullness.. but the bleedless metric is quite a bit lower
it has time complexity of O(1), your old one is O(n), so, yes
you are querying the unordered_map twice
if you want to optimise for speed, assuming the compiler doesn't do it for you, you can store the iterator find returns instead
i just run it and it seems to be slower than my for_each
maybe i have a different problem somewhere
surely my beloved clang understand my need with -O3

so this isnt just "take an element from array" actually, this is some super search mechanism behind the scenes?
i fear no main
but that thing
-O3
it scares me.
*it probably should
it's just doing normal map things
gets a bucket, yada yada, checks if the key exists, if not it creates a new value
you might replace it with .at(current_hash) and MIGHT notice a speedup, but that depends on compiler flags and optimisations more than anything
plus it'd be a pretty tiny speedup
WAIT does it mean when i search it next time, it will find this "fake" search?
i recommend just storing the iterator
uh nvm i think i got it
there's no fake search, you know the key exists
programmers judging if the + operators are faster than << for std::cout
ok so i do this first now
<< is faster, surely
✅
there'll always be stackoverflow fucks saying it's not 
the if() isnt a problem it just works like that.
the problem is to get the content
don't call that
do int value = *something_something;
or something_something->second
✅
first is the key, second is the value
now it isnt slow

magic
yeeeeeeah

if you're using alpha-beta pruning, you should be storing more data other than the evaluation, as the node trees are not fully searched but pruned.
See https://www.chessprogramming.org/Transposition_Table
behold the chess fancy terms

if you're storing more than 16 bytes of data i'd consider changing your auto value = foo->second; to a auto &value = foo->second for speed reasons 
(i pulled 16 bytes out my ass, very arbitrary limit)
my transposition table is {depth, nodeType, eval, bound}, if you want as reference

i have no idea what to do with that additional information
do i just rebuild the hashed situation
with their alpha,beta, depth, whatver
i thought im supposed to happily return after hash was found
wuh
just read the wiki I dunno how to explain

read Sebastian Legue's vlog and bot source code for reference
perhaps Boychesser as well
holy molly it's 1:32am already
I have school tmr at 7am
cooked
gn programming
i love barely understanding the way stuff gets built
it totally does not case me to run in circles
it cases you
I have a .a library, inside are a bunch of .o files
how in the everloving hell can I decompile those?? fwiw ```
$ file main.o
main.o: LLVM IR bitcode
because google is sending me in circles, I couldn't get anything to link with llvm earlier
iirc it was llvm-dis to go from bitcode to .ll
and then idk from there
there was/is an llvm c backend huh, interesting
.ll is probably gonna be your final stop, you can't gleam any more meaningful information from just a bytecode file
I have ida so if I can throw it there that'd be great
https://github.com/JuliaHubOSS/llvm-cbe there's this, wonder how well it works though 
should be able to convert to a text representation if you have roughly the correct version of LLVM at least
dunno about anything resembling proper decompilation
you could rewrite it in c in a way that mimics the outputted .ll
generally, a good chunk of information gets lost in translation, so yeah you aren't gonna get a c file that easily :3
greetings people, could you give me some information about how vedal made such a fast responding ai with personality, i have some projects of my own which could greatly benefit from that information
I'm not expecting a perfectly 1:1 c file
I'm just hoping that I don't have to learn to read raw llvm ir as well
also it looks like this has full debug symbols, so I really should be able to get the source C file back
AVFormatContext oh god oh fuck why is there ffmpeg
i found this
rain, do you perhaps have some knowledge about the inner workings of neurosama?
no, i don't spend time researching llms personally
i'm only here cuz i think the tutel is entertaining
can confirm this works btw, it's not the prettiest c but it's better than having to read IR (needs llvm 19)

it only needs llvm so i doubt it can be too bad
C:\JL\pi32\bin\llvm-objdump.exe: '.\main.o': The file was not recognized as a valid object file 
thank you objdump
very reassuring
do you know someone who has more information about what i am looking for?
consider the inner workings of neuro a trade secret 
idk, email vedal if you feel up to it, he has his email up on his site
i doubt you'll get much of an answer though
it said it's ir bitcode so checks out
will try in a bit
have been mildly hyperfocused on this for like 2 hours and mentally dying at this point

where has 400gb of disk space gone
trying to solve why my twitch tab takes up 10 GIGABYTES of ram, but it's so much ram, that the debug tools and the tab crash when trying to check the heap
ah were
a
7TV? I know it leaks memory on Windows at least
might very well be, it's just a little confusing since it would be integrated into the twitch process
Extensions run within their own space
heap shapshots are pretty useless, but allocation sampling gave me this:
explosion imminent
i should sleep
this doesn't feel like it should be as hard as I'm making it
I havve a .a file with the library
all I should need to do it make that into something ida can read
which should just be building an executable that includes it
ok so
half my issue
is that this library's build tools use clang 4.2.1
so presumably that's the version that the included libraries are
surely putting all of clang into ida is a good idea
because i can't figure out how to list targets on that version

fksdjflsdkjfldksjf
make sure to tell it if it does not work you will be very very sad
and that it should work
it does wonders
-# i have no clue why that helps but it does somehow
-# probably wont do anything for anyone else smh
tried to take a screenshot, whatever this is happened instead
wait so i just got a situation
where both sides had 1 king and 1 knight
when one of knights got taken, game ends by insufficient mating material.
??? so while enemy had knight, it was possible to mate him, but when he lost it, it became impossible
lmao discord cant even embed it
its jsut 2555x2 pixels

how did it go from 2555x2 to 550x0 on discords end?
550 is just the width it's rendered as
ah
it basicly just took a 2 pixel wide slice of my screen
Not for me
if this could be considered “fine”. i can’t tap it
oh
thats not visible on my end
might be a discord ios vs android thing? assuming you're on ios
i am. should be the same app tho

its hard to navigate in github if you are not using it constantly
or havent used it much
make an EXE file and give it to me. STUPID FUCKING SMELLY NERDS
how do they know how to compile but not navigate github 😭
well you dont need github to compile
sometimes people dont build an exe indeed
so you actually have to compile 
setting up the ide, dependencies and all
install 50 compilers and libraries for the compilers
i can see most people just not doing it and stopping there
it makes sense if you actually want people to be "worthy" to use your program
but they bothered to set up the building env for it
which didnt work
you can install visual studio, throw some project in it and just build with random compiler
which will give bunch of errors and it seems where they stopped
is it random enough
so i think my transpositions work but
it gives no performance boost at all
i only use depth+value though
and i have no iterative search maybe they are connected
lol true ig
what if
I just build clang 4.2 myself
surely the .o files will read perfectly with no issues whatsoever
(curse whoever removed targets other than their own)
i havent 
it was 30 min max before i wrote that
tbh i worked on the bot for more than 4 hours today
you should've already
already 
people just want "download button"
[DOWNLOAD HERE] [SOURCE CODE]
The end user will still click source code lmfao
because its highlighted with green
and release is written in thin font somewhere bottom right
and release != download so isnt eye catching
you see you click big green button (code)
and it has download zip
"must be download"
thats the problem
???
hello
please read what I just said
although I will agree that among certain groups of end users critical thinking is lacking
wtf is "github pages"
static web pages hosted on github
https://github.io the landing page wont stick but you can see it for like half a second
Websites for you and your projects, hosted directly from your GitHub repository. Just edit, push, and your changes are live.
oh ok cool embed works too
but when you search for program you get on this page
yeah because the program has been on github for idfk how long
if you make it the github page's problem then people will start linking to that more
does anyone uses those "github pages" even
yk, assuming you actually mention it
first time i hear about it
You are sorely lacking in knowledge then
i am
checks out
considering web frameworks actively have a deployment guide for github pages I'm sure some people use it 
anyways
it's not usable for anything requiring a server
or well not super usable
so that's why most people only use it for personal stuff + documentation
and project landing pages
yk, not very interesting stuff interactivity-wise
though ig some games have been hosted there
oh so i might have not noticed it being github at all
when i landed on such page
because it looks nothing like github
well
nobody notices that either
i mean people who are not using/used github as active developers
so they probably find that fancy "download" button and have no idea it was github
when we say github we think about that
i'm personally moving off github and onto codeberg
github's philosophy no longer aligns with mine
how would i know about "github pages" then 
its not what they teach you in school
now i know 
github pages are a github thing instead of being a git thing so it makes sense to skip talking about it in vcs lessons
what lessons
funnily enough we DID get taught to deploy to github pages as part of our git intro
that is odd
makes sense i guess ¯_(ツ)_/¯

speedy python
speedy python ❌
python on speed ✅
the suspicious looking github.io in the browser url
github pages allow you to provide your own domain
ik
but at least you would know if it says *.github.io in the browser bar
you can host your frontend from gh pages. if you need a backend just do that using a separate service
it will still be .github.io but with interactivity
vercel for maximum cost mhm
that's why I said it's not super practical
https://azaka.fun/ and basically all websites/blogs I have are all just GitHub pages
gh pages can be used to host many sophisticated sites long as it's all statically built
yeah
you can slam an entire blazor project on there if you wanted
I used to use github pages for everything but when I got custom domain I was annoyed that fronting it with cloudflare would just cause SSL issues so I eventually just moved
not necessarily github's fault
blazor
just don't proxy
that's because you had a full TLS chain
I'd rather still proxy so I can set up redirect rules on subpages
don't worry it's the jankiest setup you will ever see
just use cf pages atp
azaka.fun is proxied and has multiple page rules
where do you think I moved lol

oh well
I just moved anyways
bonus is that if I ever switch git hosts I don't have to go rewrite all the links that used to use github.io
I think I need to stop using disposables
you guys ever get a thought that you wanted to write down but when you write it down you don't remember what it is anymore?
I have a hard choice:
Go to sleep (it's 3 am, get up at 6 am
)
or
Using mystical night enlightenment and start programming
What to choose...
had that choice last night, decided to go for the second option, got out of troubleshooting hell
sleep is a mistake
I hope this power will help me
Man this is hard, I can't find her at all
i’m having trouble sleeping again fuck
just dont do discord
i came onto here because i’m having trouble sleeping not the other way around
rsync and sftp exist 
scp works with ssh keys tho
i thiink
the other prolyl do to ngl
the scp foundation uses ssh keys 
there's nothing inherently wrong with scp necessarily, we just have better tools for most use cases nowadays 
me when the
skybox
im goign to bed now
this took way too logn to debug when i just had a multiplication order issue in the fuckign shader

blender is gonna make me crash out
like why is this texture black while having the correct texture in the icon
even in the paint window it's just fully black, like where did my texture go???? i made it by hand in this window earlier today but blender voided it
bad news: my bot has some rather bad memory leak issues
good news: windows can clean up the memory leaks just fine (although it does stress the cpu a bit to clear 50gb of leaked memory all at once)
guess i can safely ignore that problem for now
Alpha? Or something like that
Some layer blocking everything
currently learning arrays


Btw pop returns the element that was removed not the new array
yeah i just learned
also the strategy i was doing didn't work where i would just "numbers.push(1).shift();"
so i have to do it separately
it adds another thing into the array
at the end
I mean yeah
also shift somehow removes the extra numbers
the js array methods are kind of weird like that, you'll get used to it
Apparently push returns the new length hmmm
it is what it is 
wow
i did numbers.pop().reverse();
and it didnt work
You're trying to reverse a number
no
Yes
i am trying to remove the first number
That's what you're doing
instead of the last
nah
Does shift not work
i did use it
wait shift removed the first number
nvm

okay idk how this works anymore
It shifts everything by one
its somehow different with words
wdym
i dont even know what i am saying
im just gonna fully focus and get the results
my brain cant do discord and coding
thanks!
When in doubt mdn is your best friend
oh, i see 
i will try if confused





