I choose another set of parameters after a number of tries and start from the first step again without removing all then pieces. Like choosing another strategy.
Ennoeis pos evales 233 kommatia sti seira i me kena metaksi tous? Ego sti seira exo valei 215, eno me kena 247, xoris na yparxei epafi dyo kommation pou den tairiazoun.
Asxoloumai peripou enan xrono. Exo grapsei programma se C pou to exo ekseliksei arketa kai exo petixei kai ena megalo skor tairiasmaton. An theleis na poume perissotera grapse mou sto xalakat at yhoo teleia kom.
If I was using brute force then it would be 1.000.000 faster too but hopeless. There are mary parallel routines running. I'm trying to find patterns using predictive filters etc. There is no way to find the solution by trying every possible combination or by placing the pieces randomly. Except if you are feeling lucky.
i did it using same method and 1 000 000 faster. i made really optimized algorithm for this. on that program on video is BIG disadvantage that it is drawing. try to draw every 100 000 calculations (if calccount%100000 = 0) draw)... There is one advice too, you possibly cant compute this using personal computer, only super computer can solve this.
I know my friend, the solution is an "illusion" with normal PCs. I built a new algorithm now and the max pieces that I have found are 233. I never gone more. How many pieces you have found? (thanks for the advise for drawing. I'll do it so)
the 233 was that tell you first pice that could not be plased ? My program gets to 200 in about an houre ante the max is 211. but I dont go and try to fill the edges and remaning pices whene i hit a max an start to back track.
have you solved it yet?
TheEpiphan3 7 months ago
Hahahha none of them is brute force?!?! hahahaha
The searching strategy is clearly showing something different on the screen dude.
Anyways, cheers for the aproach mate!
fcismondi 1 year ago
Where can i find solutions for clue puzzle?
umm86 1 year ago
Ignore the clueless morons laughing at pascal, they've obviously never heard of Donald Knuth.
Tapecutter59 1 year ago
you rule. Nice coding. Love the music too
v8metal 2 years ago
Πάμε ρε συμπατριώτη!!!!
Vikentiosch 2 years ago
actually i retract my last comment. After watching the video good on you for trying
xcalibur1979 3 years ago
ummm wtf PASCAL
that says a lot about your ability to solve a problem like this ... sorry
xcalibur1979 3 years ago
LOL PASCAL
kcinpatrick 3 years ago
Maybe he is 50 years old and doesnt know any other languages.
Keskusrikospoliisi 3 years ago
No. I'm actually 117 y.o. :)
planmix 3 years ago
I have a version on punched cards too :)
planmix 3 years ago
Why do you reset the algorithm?
PobodysNerfectII 3 years ago
It's not reset="start from the begining".
I choose another set of parameters after a number of tries and start from the first step again without removing all then pieces. Like choosing another strategy.
planmix 3 years ago
This has been flagged as spam show
w w w . youtube . c o m / watch?v=aDzZlDnIfsg
spongebob20005 3 years ago
Can someone this algorithm for the game "Splash Back" build?
youtube ---- watch?v=aDzZlDnIfsg
spongebob20005 3 years ago
Ennoeis pos evales 233 kommatia sti seira i me kena metaksi tous? Ego sti seira exo valei 215, eno me kena 247, xoris na yparxei epafi dyo kommation pou den tairiazoun.
xalakat 3 years ago
233 sth seira apo to 1-A mexri kai to O-9, alla ti na to kaneis;
Kai ena kommati na sou meinei sto xeri einai
ison me tipota :(
Xrisimopoieis software na fantastw.
Exeis grapsei esy kapoio diko sou?
planmix 3 years ago
Y.G. Me kena endiamesa, to maximum pou eftasa einai 245.
planmix 3 years ago
Asxoloumai peripou enan xrono. Exo grapsei programma se C pou to exo ekseliksei arketa kai exo petixei kai ena megalo skor tairiasmaton. An theleis na poume perissotera grapse mou sto xalakat at yhoo teleia kom.
xalakat 3 years ago
cool
djgangster3 3 years ago
uf! I think you waste too much time drawing...
ivoryvampire 3 years ago
rofl, so slow algorithm. my algorithm was 1 000 000 times faster and it was not enought, you cant compute that this way...
TheOrangeEvil 3 years ago
If I was using brute force then it would be 1.000.000 faster too but hopeless. There are mary parallel routines running. I'm trying to find patterns using predictive filters etc. There is no way to find the solution by trying every possible combination or by placing the pieces randomly. Except if you are feeling lucky.
planmix 3 years ago
i did it using same method and 1 000 000 faster. i made really optimized algorithm for this. on that program on video is BIG disadvantage that it is drawing. try to draw every 100 000 calculations (if calccount%100000 = 0) draw)... There is one advice too, you possibly cant compute this using personal computer, only super computer can solve this.
TheOrangeEvil 3 years ago
I know my friend, the solution is an "illusion" with normal PCs. I built a new algorithm now and the max pieces that I have found are 233. I never gone more. How many pieces you have found? (thanks for the advise for drawing. I'll do it so)
planmix 3 years ago
the 233 was that tell you first pice that could not be plased ? My program gets to 200 in about an houre ante the max is 211. but I dont go and try to fill the edges and remaning pices whene i hit a max an start to back track.
Steve
Stevewaynerogers 3 years ago
polu kalos...
kyrkat 3 years ago