Zachary Danziger

Roel H,
Agreed on both counts. The code has been updated and re-posted. Doing some quick testing, the updates you recommended significantly improve speed for very large matrices, thank you.

I used this function and it worked as advertised. Additionally, it made me happy.
The following suggestions are not shortcomings of the code, only my wish-list for the code, and I will list them in the order of how much I wish for them (I have not opened the code, so I don’t know how hard it would be to modify it).

1- More sophisticated time controls. I.e., 1st 20 moves in 15min, then an additional time increment is added, or the “hourglass” time control (one of my favorites).
2- A GUI button to pause the clock.
3- A noise, flashing or color change when one side has run out of time, rather than a pop-up.
4- A way to close the GUI during play without generating an error and without needing to press escape (a GUI button to call up the menu rather than hitting escape).

Notes: The code supports negative time increments, and while I have never seen or heard of this in actual chess play, it is absolutely hilarious to see. You cannot, however, set your increment or starting time to “pi”. This will not cause an error, but it will give you “nan” minutes to work with. Imaginary values will generate errors. Setting initial times to negative numbers will result in the expected out of time message.

Cool.

Nice code, thanks for writing this function!

Though I have a few remarks. For the largeMat case, it is better to use bsxfun instead of repmat, as it is more efficient(faster) for large matrices which obviously is the case. Also it may be an idea to postpone the "sqrt" call untill a maximum is found. This won't change the outcome, but should require less computations

%existing code:
minP = min(sqrt(sum((repmat(P(p,:),[sQ(1) 1]) - Q).^2,2)));
%sugestion:
minP = min(sum((bsxfun(@minus,P(p,:),Q)).^2,2));