Anti-Bloatware competition
-
What goes on in a womens head
"...great scott!" Dilbert: Aren't all meetings like this... Richard Dawkins: "What if you're wrong?"
You'd want something tractable! Might as well try to solve P = NP.
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Chris Maunder wrote:
- comparing large lists
This one looks like a fun task. Preferably, you'd provide the list so that the competitors would be dealing with the same data. Failing that, traveling salesman is always a cool one. [edit] Ideally, you'd also limit what we can and can't do and what parts of the framework can and can't be used.
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
-
You'd want something tractable! Might as well try to solve P = NP.
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
Mustafa Ismail Mustafa wrote:
You'd want something tractable!
Yeah, suppose you're right. Although if that could be created you'd be richer than Google.
"...great scott!" Dilbert: Aren't all meetings like this... Richard Dawkins: "What if you're wrong?"
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about something with a useful result? (not calling the ones you listed useless) That way even the people who didn't win or didn't even enter get something out of it. Some suggestions: - Deflate (very open to optimization of many kinds, and used everywhere) - BWT (less open to optimization, but there is some room..) - Generic graph colourer (more useful than a specialized sudoku solver IMO) - SAT solver (very useful, lots of room for optimization, been done before but who says we can't do better?)
-
How about something with a useful result? (not calling the ones you listed useless) That way even the people who didn't win or didn't even enter get something out of it. Some suggestions: - Deflate (very open to optimization of many kinds, and used everywhere) - BWT (less open to optimization, but there is some room..) - Generic graph colourer (more useful than a specialized sudoku solver IMO) - SAT solver (very useful, lots of room for optimization, been done before but who says we can't do better?)
Great ideas (and idea)
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about a more real-world app, like a Twitter client? Every Twitter client I've seen is terribly bloated.
Religiously blogging on the intarwebs since the early 21st century: Kineti L'Tziyon Judah Himango
-
How about a more real-world app, like a Twitter client? Every Twitter client I've seen is terribly bloated.
Religiously blogging on the intarwebs since the early 21st century: Kineti L'Tziyon Judah Himango
Yes that's what the world needs: another Twitter Client to launch another DOS attack. On another note, I will not be surprised if Twitter now exercises more control on the API.
-
What goes on in a womens head
"...great scott!" Dilbert: Aren't all meetings like this... Richard Dawkins: "What if you're wrong?"
1.21 Gigawatts wrote:
What goes on in a womens head
We need 2 liters of Unicorn tears to begin with.
It is a crappy thing, but it's life -^ Carlo Pallini
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
"Hello world"
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass..." - Dale Earnhardt, 1997
-----
"...the staggering layers of obscenity in your statement make it a work of art on so many levels." - Jason Jystad, 10/26/2001 -
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
- I'll do a Towers Of Hanoi in 10 lines for you, if that is what you want. 2) I once did an optimal strategy Mastermind (4 pegs out of N colors, N<10) in 256 bytes of memory BTW: for big problems, are you prepared to look into tons of large solutions, with source files of hundreds or thousands of lines of code? is anyone? :)
Luc Pattyn [Forum Guidelines] [My Articles]
The quality and detail of your question reflects on the effectiveness of the help you are likely to get. Show formatted code inside PRE tags, and give clear symptoms when describing a problem.
-
Chris Maunder wrote:
- comparing large lists
This one looks like a fun task. Preferably, you'd provide the list so that the competitors would be dealing with the same data. Failing that, traveling salesman is always a cool one. [edit] Ideally, you'd also limit what we can and can't do and what parts of the framework can and can't be used.
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
Mustafa Ismail Mustafa wrote:
Ideally, you'd also limit what we can and can't do and what parts of the framework can and can't be used.
If you're including a/the framework I think you may have already lost. :)
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about who could create a WOPR, like in the movie war games.
"I do not know with what weapons World War 3 will be fought, but World War 4 will be fought with sticks and stones." Einstein "Few things are harder to put up with than the annoyance of a good example." Mark Twain
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Chris Maunder wrote:
Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
Or image processing, like maybe flood fill[^]? </shameless-plug> :-\ :-O Seriously, that sounds like a great idea! We aren't anywhere close to achieving the best use of the memory and processing power available to us, because most people don't make it a priority anymore.
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
I don't think I'd take on anything that difficult/involved just for fun; how about: Sieve of Eratosthenes Levenstein Distance
-
"Hello world"
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass..." - Dale Earnhardt, 1997
-----
"...the staggering layers of obscenity in your statement make it a work of art on so many levels." - Jason Jystad, 10/26/2001ROFLOL
____________________________________________________________ Be brave little warrior, be VERY brave
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
One of the very real life challenges is the riddle of the 8 queens, placing 8 queens on a chess board without 1 being able to 'take' another. A previous employer of mine had the world record in the least number of words used... Also has some nice technology challeges with collections / arrays, recursion, reuse etc
____________________________________________________________ Be brave little warrior, be VERY brave
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about this one: http://thedailywtf.com/Articles/Nerds,-Jocks,-and-Lockers.aspx[^] Scroll down the article there is a simulation at the end.
-
Mustafa Ismail Mustafa wrote:
Ideally, you'd also limit what we can and can't do and what parts of the framework can and can't be used.
If you're including a/the framework I think you may have already lost. :)
If its in .NET, you can't really do anything without the framework, now can you? :)
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
-
How about this one: http://thedailywtf.com/Articles/Nerds,-Jocks,-and-Lockers.aspx[^] Scroll down the article there is a simulation at the end.
How about a version of Linux that can be shoved onto an iPhone and allows you to do everything the iPhone can't (Such as secure your data/copypasta/interface with something other than iTunes) and also have it boot in half the time, work on the network AND take up say...1/2 the size of the current iPhone OS... Also, it may provide you an interesting sandbox for OTHER "apps" to go on it, and one rule of producing "apps" for this iNix would be that they have to be as small as possible. Oh, and being Free, Open Source, and Public, there would be almost no way for crap to sneak through, as long as everything gets peer checked and can not possibly be any smaller will it be approved for download onto the NixPhone. Just a suggestion...and so much more fun than the others... -Kasterborus Light a man a fire and he's warm for the night, light that man on fire and he's warm for the rest of his life...
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Can we use APL? ..... This topic causes us old guys to remember .... I remember vowing to never write an SNMP layer for our TCP/IP unless I could get the TSR to be less then 10K of DOS memory. I did it in 2K. The good olde days of only having 640K for everything ....
