Welcome, Guest. Please Login or Register
YaBB - Yet another Bulletin Board
 
  HomeHelpSearchLoginRegister  
 
Pages: 1
Send Topic Print
Generic A* (Read 324 times)
John Magnus
Assistant
*****
Offline



Posts: 230

Gender: male
Generic A*
06/20/07 at 19:11:08
 
Please post your ideas and questions on the A* code downloadable from http://game.johnmagnus.com
Back to top
 
 
WWW   IP Logged
Pharoah
Wise One
***
Offline



Posts: 166
Illinois, USA.
Re: Generic A*
Reply #1 - 06/21/07 at 15:51:50
 
Look's cool, like a simplifed C++ maybe?

I have a book 'for dummies' of both C++ and beginners (BASIC) programming. They both came with their own CD with a built-in compiler. Dev-C++ for C++ and Liberty BASIC for BASIC. Have you had any experience with those?

I heard theres a contest going on, a 'million dollar math contest'. There are 10 questions or problems that, if you solve, you will get a million dollars. One is the Riemann hypothesis, either proving it true or false. The other is a problem like this. You have a paper route, and you have 30 houses. You know how long it takes to get from house A to house B, and from house C to D, ect. Write a computer program that would determine the shortest route to take.

Do you think that is possible to do?
Back to top
 
 

For the first time in your life you wonder if it's all worth it.
Pharoah   IP Logged
John Magnus
Assistant
*****
Offline



Posts: 230

Gender: male
Re: Generic A*
Reply #2 - 06/21/07 at 17:41:11
 
Yes, I wrote it in C++. I was going to put the programming thing on a separate forum, but I am too lazy to maintain two forums.

I use Visual Studio mostly. I haven't tried Dev-C++. In my days of BASIC, I used QuickBasic, but I would not recommend that today.

What is the Riemann hypothesis?

The paperboy/salesman problem is a well-known NP-difficult problem, which means you will have to check every possible path to find the shortest. It's not hard to write a program to do that, it just takes a while to run it.
Back to top
 
 
WWW   IP Logged
Pharoah
Wise One
***
Offline



Posts: 166
Illinois, USA.
Re: Generic A*
Reply #3 - 06/24/07 at 22:28:54
 
The Riemann Hypothesis is about prime numbers. I am intrigued by it because it's so logicistally (sp.) simple.

The Riemann algorithm is I believe this (although I'm sure it's on the internet somewhere):

divide the previous prime number by the recipricol of the logarithm of it

That should get you to the next prime number, but I'm not sure. Gauss and Legendre did a lot of work with it, they're mathematicians.

Hm, maybe you can make a C++ program to attempt that?

(Just in case you don't know, a prime number is a number that can only be divided by that number and one, such as... 5, 7, 11, 17, 29, 37, ect., the opposite of a prime number is a composite, which is a number that can be divided by another number, such as 2, 4, 6, 8, 25, 49, ect.)

There's a dispute in mathematics about whether or not 2 is considered a prime or composite number.
Back to top
 
 

For the first time in your life you wonder if it's all worth it.
Pharoah   IP Logged
Pages: 1
Send Topic Print